./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-sp_file-87.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 1733340110531036ec2730e9cf68ec8d1d2e7f12e2ee065e03b827b6d5da2aba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:00:16,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:00:16,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:00:16,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:00:16,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:00:16,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:00:16,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:00:16,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:00:16,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:00:16,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:00:16,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:00:16,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:00:16,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:00:16,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:00:16,304 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:00:16,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:00:16,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:00:16,305 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:00:16,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:00:16,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:00:16,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:00:16,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:00:16,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:00:16,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:00:16,308 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:00:16,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:00:16,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:00:16,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:00:16,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:00:16,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:00:16,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:00:16,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:00:16,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:00:16,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:00:16,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:00:16,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:00:16,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:00:16,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:00:16,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:00:16,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:00:16,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:00:16,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:00:16,314 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 1733340110531036ec2730e9cf68ec8d1d2e7f12e2ee065e03b827b6d5da2aba [2024-11-16 19:00:16,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:00:16,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:00:16,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:00:16,598 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:00:16,598 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:00:16,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-87.i [2024-11-16 19:00:18,048 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:00:18,281 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:00:18,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-87.i [2024-11-16 19:00:18,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1d739e5/2f2aa3d1b8654850ae4593950388a4dc/FLAG530793dec [2024-11-16 19:00:18,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1d739e5/2f2aa3d1b8654850ae4593950388a4dc [2024-11-16 19:00:18,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:00:18,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:00:18,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:00:18,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:00:18,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:00:18,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:00:18" (1/1) ... [2024-11-16 19:00:18,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f99d3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:18, skipping insertion in model container [2024-11-16 19:00:18,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:00:18" (1/1) ... [2024-11-16 19:00:18,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:00:18,833 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-sp_file-87.i[917,930] [2024-11-16 19:00:18,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:00:18,944 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:00:18,957 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-sp_file-87.i[917,930] [2024-11-16 19:00:18,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:00:19,028 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:00:19,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19 WrapperNode [2024-11-16 19:00:19,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:00:19,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:00:19,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:00:19,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:00:19,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,094 INFO L138 Inliner]: procedures = 27, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2024-11-16 19:00:19,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:00:19,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:00:19,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:00:19,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:00:19,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,153 INFO L175 MemorySlicer]: Split 120 memory accesses to 2 slices as follows [2, 118]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-16 19:00:19,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,176 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:00:19,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:00:19,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:00:19,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:00:19,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (1/1) ... [2024-11-16 19:00:19,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:00:19,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:00:19,220 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) [2024-11-16 19:00:19,224 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 [2024-11-16 19:00:19,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:00:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-16 19:00:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-16 19:00:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 19:00:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 19:00:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 19:00:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 19:00:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 19:00:19,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 19:00:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:00:19,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 19:00:19,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:00:19,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:00:19,367 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:00:19,368 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:00:19,732 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~mem60#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite67#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~ite88#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem73#1;havoc property_#t~ite76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite103#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1; [2024-11-16 19:00:19,786 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-16 19:00:19,786 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:00:19,800 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:00:19,800 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:00:19,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:00:19 BoogieIcfgContainer [2024-11-16 19:00:19,801 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:00:19,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:00:19,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:00:19,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:00:19,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:00:18" (1/3) ... [2024-11-16 19:00:19,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f882ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:00:19, skipping insertion in model container [2024-11-16 19:00:19,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:00:19" (2/3) ... [2024-11-16 19:00:19,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f882ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:00:19, skipping insertion in model container [2024-11-16 19:00:19,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:00:19" (3/3) ... [2024-11-16 19:00:19,809 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-87.i [2024-11-16 19:00:19,824 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:00:19,824 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 19:00:19,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:00:19,890 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;@4b0a2523, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:00:19,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 19:00:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 73 states have (on average 1.356164383561644) internal successors, (99), 74 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 19:00:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 19:00:19,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:19,909 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:19,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:19,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1831517804, now seen corresponding path program 1 times [2024-11-16 19:00:19,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:19,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964224044] [2024-11-16 19:00:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:20,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:20,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964224044] [2024-11-16 19:00:20,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964224044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:20,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:20,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:00:20,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943648232] [2024-11-16 19:00:20,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:20,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 19:00:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:20,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 19:00:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 19:00:20,440 INFO L87 Difference]: Start difference. First operand has 90 states, 73 states have (on average 1.356164383561644) internal successors, (99), 74 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 19:00:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:20,477 INFO L93 Difference]: Finished difference Result 172 states and 261 transitions. [2024-11-16 19:00:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 19:00:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-11-16 19:00:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:20,489 INFO L225 Difference]: With dead ends: 172 [2024-11-16 19:00:20,489 INFO L226 Difference]: Without dead ends: 85 [2024-11-16 19:00:20,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 19:00:20,498 INFO L432 NwaCegarLoop]: 117 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, 117 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 [2024-11-16 19:00:20,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 19:00:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-16 19:00:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-16 19:00:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 19:00:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-11-16 19:00:20,543 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 113 [2024-11-16 19:00:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:20,543 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-11-16 19:00:20,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 19:00:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-16 19:00:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 19:00:20,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:20,547 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:20,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:00:20,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:20,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1620134074, now seen corresponding path program 1 times [2024-11-16 19:00:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866775505] [2024-11-16 19:00:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:20,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:20,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866775505] [2024-11-16 19:00:20,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866775505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:20,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:20,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:00:20,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562207971] [2024-11-16 19:00:20,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:20,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:00:20,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:20,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:00:20,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:00:20,977 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:21,030 INFO L93 Difference]: Finished difference Result 169 states and 234 transitions. [2024-11-16 19:00:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:00:21,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-16 19:00:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:21,035 INFO L225 Difference]: With dead ends: 169 [2024-11-16 19:00:21,035 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 19:00:21,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:00:21,039 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:21,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 19:00:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 19:00:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-16 19:00:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 19:00:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-11-16 19:00:21,057 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 113 [2024-11-16 19:00:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:21,059 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-11-16 19:00:21,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-11-16 19:00:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 19:00:21,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:21,062 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:21,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:00:21,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:21,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1895041693, now seen corresponding path program 1 times [2024-11-16 19:00:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:21,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106915625] [2024-11-16 19:00:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:21,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106915625] [2024-11-16 19:00:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106915625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:21,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:21,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:00:21,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831855862] [2024-11-16 19:00:21,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:21,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:00:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:00:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:00:21,334 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:21,370 INFO L93 Difference]: Finished difference Result 174 states and 239 transitions. [2024-11-16 19:00:21,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:00:21,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-16 19:00:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:21,373 INFO L225 Difference]: With dead ends: 174 [2024-11-16 19:00:21,373 INFO L226 Difference]: Without dead ends: 90 [2024-11-16 19:00:21,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:00:21,375 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 331 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 [2024-11-16 19:00:21,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 331 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 19:00:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-16 19:00:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-16 19:00:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 19:00:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-11-16 19:00:21,392 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 115 [2024-11-16 19:00:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:21,393 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-11-16 19:00:21,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-11-16 19:00:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 19:00:21,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:21,400 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:21,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:00:21,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:21,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1698528188, now seen corresponding path program 1 times [2024-11-16 19:00:21,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:21,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655093104] [2024-11-16 19:00:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:21,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:21,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655093104] [2024-11-16 19:00:21,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655093104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:21,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:21,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:00:21,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659353006] [2024-11-16 19:00:21,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:21,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:00:21,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:21,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:00:21,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:00:21,643 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:21,679 INFO L93 Difference]: Finished difference Result 178 states and 243 transitions. [2024-11-16 19:00:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:00:21,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-16 19:00:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:21,681 INFO L225 Difference]: With dead ends: 178 [2024-11-16 19:00:21,681 INFO L226 Difference]: Without dead ends: 92 [2024-11-16 19:00:21,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:00:21,683 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:21,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 332 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 19:00:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-16 19:00:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-16 19:00:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 19:00:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-11-16 19:00:21,691 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 115 [2024-11-16 19:00:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:21,691 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-11-16 19:00:21,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-11-16 19:00:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 19:00:21,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:21,693 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:21,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:00:21,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:21,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:21,694 INFO L85 PathProgramCache]: Analyzing trace with hash -853628773, now seen corresponding path program 1 times [2024-11-16 19:00:21,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:21,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136627666] [2024-11-16 19:00:21,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:21,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:22,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:22,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136627666] [2024-11-16 19:00:22,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136627666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:22,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:22,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:00:22,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790399246] [2024-11-16 19:00:22,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:22,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 19:00:22,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:22,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 19:00:22,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 19:00:22,572 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:22,984 INFO L93 Difference]: Finished difference Result 227 states and 308 transitions. [2024-11-16 19:00:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:00:22,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-16 19:00:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:22,986 INFO L225 Difference]: With dead ends: 227 [2024-11-16 19:00:22,987 INFO L226 Difference]: Without dead ends: 139 [2024-11-16 19:00:22,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:00:22,988 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 240 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:22,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 243 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 19:00:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-16 19:00:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2024-11-16 19:00:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 19:00:23,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2024-11-16 19:00:23,010 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 115 [2024-11-16 19:00:23,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:23,012 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2024-11-16 19:00:23,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2024-11-16 19:00:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 19:00:23,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:23,014 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:23,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:00:23,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:23,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1965546308, now seen corresponding path program 1 times [2024-11-16 19:00:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:23,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832978089] [2024-11-16 19:00:23,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:23,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:23,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832978089] [2024-11-16 19:00:23,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832978089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:23,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:23,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:00:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128629009] [2024-11-16 19:00:23,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:23,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 19:00:23,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:23,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 19:00:23,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 19:00:23,758 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:24,147 INFO L93 Difference]: Finished difference Result 256 states and 349 transitions. [2024-11-16 19:00:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:00:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-16 19:00:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:24,150 INFO L225 Difference]: With dead ends: 256 [2024-11-16 19:00:24,150 INFO L226 Difference]: Without dead ends: 156 [2024-11-16 19:00:24,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-16 19:00:24,151 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 130 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:24,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 434 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 19:00:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-16 19:00:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 123. [2024-11-16 19:00:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.308411214953271) internal successors, (140), 107 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 19:00:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 168 transitions. [2024-11-16 19:00:24,165 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 168 transitions. Word has length 115 [2024-11-16 19:00:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:24,166 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 168 transitions. [2024-11-16 19:00:24,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 168 transitions. [2024-11-16 19:00:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-16 19:00:24,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:24,171 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:24,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:00:24,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:24,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:24,172 INFO L85 PathProgramCache]: Analyzing trace with hash -256997515, now seen corresponding path program 1 times [2024-11-16 19:00:24,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:24,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53953249] [2024-11-16 19:00:24,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:24,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:26,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:26,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53953249] [2024-11-16 19:00:26,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53953249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:26,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:26,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 19:00:26,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657957035] [2024-11-16 19:00:26,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:26,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 19:00:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:26,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 19:00:26,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-16 19:00:26,374 INFO L87 Difference]: Start difference. First operand 123 states and 168 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-16 19:00:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:27,178 INFO L93 Difference]: Finished difference Result 284 states and 384 transitions. [2024-11-16 19:00:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:00:27,178 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 116 [2024-11-16 19:00:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:27,180 INFO L225 Difference]: With dead ends: 284 [2024-11-16 19:00:27,180 INFO L226 Difference]: Without dead ends: 164 [2024-11-16 19:00:27,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-16 19:00:27,181 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 281 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:27,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 368 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 19:00:27,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-16 19:00:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2024-11-16 19:00:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.297872340425532) internal successors, (183), 142 states have internal predecessors, (183), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 19:00:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 215 transitions. [2024-11-16 19:00:27,210 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 215 transitions. Word has length 116 [2024-11-16 19:00:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:27,211 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 215 transitions. [2024-11-16 19:00:27,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-16 19:00:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 215 transitions. [2024-11-16 19:00:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 19:00:27,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:27,212 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:27,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:00:27,213 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:27,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash -226342530, now seen corresponding path program 1 times [2024-11-16 19:00:27,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:27,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185934373] [2024-11-16 19:00:27,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:27,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:32,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:32,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185934373] [2024-11-16 19:00:32,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185934373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:32,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:32,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 19:00:32,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599311470] [2024-11-16 19:00:32,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:32,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 19:00:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 19:00:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-16 19:00:32,362 INFO L87 Difference]: Start difference. First operand 160 states and 215 transitions. Second operand has 16 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 16 states have internal predecessors, (50), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-16 19:00:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:34,150 INFO L93 Difference]: Finished difference Result 389 states and 519 transitions. [2024-11-16 19:00:34,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 19:00:34,151 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 16 states have internal predecessors, (50), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 117 [2024-11-16 19:00:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:34,154 INFO L225 Difference]: With dead ends: 389 [2024-11-16 19:00:34,154 INFO L226 Difference]: Without dead ends: 232 [2024-11-16 19:00:34,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2024-11-16 19:00:34,155 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 318 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:34,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 554 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 19:00:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-16 19:00:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 156. [2024-11-16 19:00:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 137 states have (on average 1.2919708029197081) internal successors, (177), 138 states have internal predecessors, (177), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 19:00:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 209 transitions. [2024-11-16 19:00:34,189 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 209 transitions. Word has length 117 [2024-11-16 19:00:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:34,190 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 209 transitions. [2024-11-16 19:00:34,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 16 states have internal predecessors, (50), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-16 19:00:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 209 transitions. [2024-11-16 19:00:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 19:00:34,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:34,191 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:34,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 19:00:34,191 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:34,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1092648197, now seen corresponding path program 1 times [2024-11-16 19:00:34,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:34,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257805425] [2024-11-16 19:00:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:34,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:34,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:34,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257805425] [2024-11-16 19:00:34,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257805425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:34,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:34,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 19:00:34,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601438103] [2024-11-16 19:00:34,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:34,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:00:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:34,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:00:34,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:00:34,697 INFO L87 Difference]: Start difference. First operand 156 states and 209 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:34,980 INFO L93 Difference]: Finished difference Result 301 states and 402 transitions. [2024-11-16 19:00:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:00:34,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-16 19:00:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:34,985 INFO L225 Difference]: With dead ends: 301 [2024-11-16 19:00:34,987 INFO L226 Difference]: Without dead ends: 148 [2024-11-16 19:00:34,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:00:34,989 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 189 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:34,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 228 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 19:00:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-16 19:00:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2024-11-16 19:00:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 126 states have (on average 1.2777777777777777) internal successors, (161), 127 states have internal predecessors, (161), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 19:00:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 193 transitions. [2024-11-16 19:00:35,012 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 193 transitions. Word has length 117 [2024-11-16 19:00:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:35,013 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 193 transitions. [2024-11-16 19:00:35,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 193 transitions. [2024-11-16 19:00:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 19:00:35,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:35,014 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:35,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:00:35,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:35,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1787374508, now seen corresponding path program 1 times [2024-11-16 19:00:35,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:35,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435174934] [2024-11-16 19:00:35,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:35,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:36,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:36,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435174934] [2024-11-16 19:00:36,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435174934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:36,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:36,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 19:00:36,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557828443] [2024-11-16 19:00:36,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:36,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 19:00:36,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:36,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 19:00:36,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-16 19:00:36,764 INFO L87 Difference]: Start difference. First operand 145 states and 193 transitions. Second operand has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 19:00:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:38,122 INFO L93 Difference]: Finished difference Result 390 states and 515 transitions. [2024-11-16 19:00:38,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 19:00:38,123 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2024-11-16 19:00:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:38,125 INFO L225 Difference]: With dead ends: 390 [2024-11-16 19:00:38,127 INFO L226 Difference]: Without dead ends: 248 [2024-11-16 19:00:38,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-11-16 19:00:38,130 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 440 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:38,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 337 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 19:00:38,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-16 19:00:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 241. [2024-11-16 19:00:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 206 states have (on average 1.2475728155339805) internal successors, (257), 209 states have internal predecessors, (257), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 19:00:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 317 transitions. [2024-11-16 19:00:38,188 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 317 transitions. Word has length 117 [2024-11-16 19:00:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:38,189 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 317 transitions. [2024-11-16 19:00:38,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 19:00:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 317 transitions. [2024-11-16 19:00:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 19:00:38,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:38,190 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:38,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:00:38,191 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:38,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:38,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1758745357, now seen corresponding path program 1 times [2024-11-16 19:00:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74361816] [2024-11-16 19:00:38,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:38,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74361816] [2024-11-16 19:00:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74361816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:39,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:39,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 19:00:39,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501248956] [2024-11-16 19:00:39,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:39,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 19:00:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:39,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 19:00:39,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-16 19:00:39,639 INFO L87 Difference]: Start difference. First operand 241 states and 317 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 19:00:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:40,193 INFO L93 Difference]: Finished difference Result 256 states and 332 transitions. [2024-11-16 19:00:40,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:00:40,194 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2024-11-16 19:00:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:40,196 INFO L225 Difference]: With dead ends: 256 [2024-11-16 19:00:40,196 INFO L226 Difference]: Without dead ends: 253 [2024-11-16 19:00:40,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-16 19:00:40,196 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 333 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:40,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 290 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 19:00:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-16 19:00:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 247. [2024-11-16 19:00:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 212 states have (on average 1.240566037735849) internal successors, (263), 215 states have internal predecessors, (263), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 19:00:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 323 transitions. [2024-11-16 19:00:40,245 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 323 transitions. Word has length 117 [2024-11-16 19:00:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:40,245 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 323 transitions. [2024-11-16 19:00:40,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 19:00:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 323 transitions. [2024-11-16 19:00:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 19:00:40,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:40,247 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:40,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 19:00:40,247 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:40,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash -764782453, now seen corresponding path program 1 times [2024-11-16 19:00:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:40,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717110918] [2024-11-16 19:00:40,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:40,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:41,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:41,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717110918] [2024-11-16 19:00:41,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717110918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:41,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:41,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 19:00:41,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934834025] [2024-11-16 19:00:41,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:41,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:00:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:41,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:00:41,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:00:41,337 INFO L87 Difference]: Start difference. First operand 247 states and 323 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 19:00:41,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:41,807 INFO L93 Difference]: Finished difference Result 494 states and 645 transitions. [2024-11-16 19:00:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:00:41,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-16 19:00:41,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:41,811 INFO L225 Difference]: With dead ends: 494 [2024-11-16 19:00:41,811 INFO L226 Difference]: Without dead ends: 250 [2024-11-16 19:00:41,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-16 19:00:41,812 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 370 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:41,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 199 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 19:00:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-16 19:00:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2024-11-16 19:00:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 212 states have (on average 1.2311320754716981) internal successors, (261), 215 states have internal predecessors, (261), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 19:00:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 321 transitions. [2024-11-16 19:00:41,875 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 321 transitions. Word has length 117 [2024-11-16 19:00:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:41,875 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 321 transitions. [2024-11-16 19:00:41,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 19:00:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 321 transitions. [2024-11-16 19:00:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 19:00:41,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:41,877 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:41,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 19:00:41,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:41,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:41,878 INFO L85 PathProgramCache]: Analyzing trace with hash -961295958, now seen corresponding path program 1 times [2024-11-16 19:00:41,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:41,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130236434] [2024-11-16 19:00:41,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:42,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:42,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130236434] [2024-11-16 19:00:42,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130236434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:42,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:42,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 19:00:42,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602184595] [2024-11-16 19:00:42,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:42,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:00:42,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:42,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:00:42,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:00:42,184 INFO L87 Difference]: Start difference. First operand 247 states and 321 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:42,482 INFO L93 Difference]: Finished difference Result 644 states and 827 transitions. [2024-11-16 19:00:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:00:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-16 19:00:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:42,486 INFO L225 Difference]: With dead ends: 644 [2024-11-16 19:00:42,486 INFO L226 Difference]: Without dead ends: 400 [2024-11-16 19:00:42,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-16 19:00:42,487 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 163 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:42,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 371 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 19:00:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-16 19:00:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 311. [2024-11-16 19:00:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 276 states have (on average 1.2282608695652173) internal successors, (339), 279 states have internal predecessors, (339), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 19:00:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 399 transitions. [2024-11-16 19:00:42,539 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 399 transitions. Word has length 117 [2024-11-16 19:00:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:42,539 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 399 transitions. [2024-11-16 19:00:42,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 399 transitions. [2024-11-16 19:00:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 19:00:42,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:42,541 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:42,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 19:00:42,541 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:42,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:42,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1936451308, now seen corresponding path program 1 times [2024-11-16 19:00:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:42,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249135633] [2024-11-16 19:00:42,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:42,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:42,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:42,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249135633] [2024-11-16 19:00:42,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249135633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:42,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:42,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 19:00:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228085328] [2024-11-16 19:00:42,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:42,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:00:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:42,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:00:42,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:00:42,856 INFO L87 Difference]: Start difference. First operand 311 states and 399 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:43,257 INFO L93 Difference]: Finished difference Result 759 states and 973 transitions. [2024-11-16 19:00:43,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:00:43,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-16 19:00:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:43,260 INFO L225 Difference]: With dead ends: 759 [2024-11-16 19:00:43,260 INFO L226 Difference]: Without dead ends: 451 [2024-11-16 19:00:43,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-16 19:00:43,261 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 127 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:43,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 606 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 19:00:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-16 19:00:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 361. [2024-11-16 19:00:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 326 states have (on average 1.2239263803680982) internal successors, (399), 329 states have internal predecessors, (399), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 19:00:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 459 transitions. [2024-11-16 19:00:43,315 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 459 transitions. Word has length 118 [2024-11-16 19:00:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:43,315 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 459 transitions. [2024-11-16 19:00:43,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:00:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 459 transitions. [2024-11-16 19:00:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 19:00:43,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:43,317 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:43,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 19:00:43,317 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:43,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash -143679163, now seen corresponding path program 1 times [2024-11-16 19:00:43,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:43,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479716841] [2024-11-16 19:00:43,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:43,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-16 19:00:44,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:44,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479716841] [2024-11-16 19:00:44,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479716841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:00:44,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51351256] [2024-11-16 19:00:44,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:44,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:00:44,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:00:44,004 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) [2024-11-16 19:00:44,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 19:00:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:44,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-16 19:00:44,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:00:47,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 19:00:47,804 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 46 treesize of output 39 [2024-11-16 19:00:47,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:00:47,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:00:47,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:00:47,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:00:47,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:00:47,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-16 19:00:47,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:00:47,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:00:47,926 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-16 19:00:47,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 37 [2024-11-16 19:00:48,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:00:48,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:00:48,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:00:48,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:00:48,109 INFO L349 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2024-11-16 19:00:48,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 48 [2024-11-16 19:00:48,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-16 19:00:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 19:00:48,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:00:48,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51351256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:00:48,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 19:00:48,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-11-16 19:00:48,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34733201] [2024-11-16 19:00:48,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 19:00:48,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 19:00:48,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:48,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 19:00:48,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=484, Unknown=1, NotChecked=0, Total=552 [2024-11-16 19:00:48,632 INFO L87 Difference]: Start difference. First operand 361 states and 459 transitions. Second operand has 20 states, 17 states have (on average 5.411764705882353) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-16 19:00:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:50,060 INFO L93 Difference]: Finished difference Result 585 states and 747 transitions. [2024-11-16 19:00:50,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 19:00:50,060 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 5.411764705882353) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) Word has length 118 [2024-11-16 19:00:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:50,062 INFO L225 Difference]: With dead ends: 585 [2024-11-16 19:00:50,062 INFO L226 Difference]: Without dead ends: 227 [2024-11-16 19:00:50,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=997, Unknown=1, NotChecked=0, Total=1190 [2024-11-16 19:00:50,064 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 213 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:50,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 487 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 19:00:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-16 19:00:50,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2024-11-16 19:00:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 190 states have (on average 1.2105263157894737) internal successors, (230), 192 states have internal predecessors, (230), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 19:00:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 286 transitions. [2024-11-16 19:00:50,128 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 286 transitions. Word has length 118 [2024-11-16 19:00:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:50,129 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 286 transitions. [2024-11-16 19:00:50,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 5.411764705882353) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-16 19:00:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 286 transitions. [2024-11-16 19:00:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 19:00:50,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:50,132 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:50,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 19:00:50,335 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,SelfDestructingSolverStorable14 [2024-11-16 19:00:50,335 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:50,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash -980934705, now seen corresponding path program 1 times [2024-11-16 19:00:50,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:50,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679676432] [2024-11-16 19:00:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:50,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:51,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679676432] [2024-11-16 19:00:51,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679676432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:51,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:51,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 19:00:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736823530] [2024-11-16 19:00:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:51,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 19:00:51,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 19:00:51,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-16 19:00:51,687 INFO L87 Difference]: Start difference. First operand 223 states and 286 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 19:00:52,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:52,191 INFO L93 Difference]: Finished difference Result 413 states and 528 transitions. [2024-11-16 19:00:52,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:00:52,191 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2024-11-16 19:00:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:52,193 INFO L225 Difference]: With dead ends: 413 [2024-11-16 19:00:52,193 INFO L226 Difference]: Without dead ends: 223 [2024-11-16 19:00:52,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-16 19:00:52,194 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 367 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:52,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 146 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 19:00:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-16 19:00:52,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-11-16 19:00:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 190 states have (on average 1.1789473684210525) internal successors, (224), 192 states have internal predecessors, (224), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 19:00:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 280 transitions. [2024-11-16 19:00:52,253 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 280 transitions. Word has length 119 [2024-11-16 19:00:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:52,253 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 280 transitions. [2024-11-16 19:00:52,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 19:00:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 280 transitions. [2024-11-16 19:00:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 19:00:52,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:52,255 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:52,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 19:00:52,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:52,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1120617614, now seen corresponding path program 1 times [2024-11-16 19:00:52,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:52,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818819367] [2024-11-16 19:00:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:54,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:54,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818819367] [2024-11-16 19:00:54,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818819367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:54,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:54,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 19:00:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936794129] [2024-11-16 19:00:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:54,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 19:00:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:54,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 19:00:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-16 19:00:54,547 INFO L87 Difference]: Start difference. First operand 223 states and 280 transitions. Second operand has 12 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 19:00:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:55,500 INFO L93 Difference]: Finished difference Result 417 states and 522 transitions. [2024-11-16 19:00:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:00:55,501 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-11-16 19:00:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:55,502 INFO L225 Difference]: With dead ends: 417 [2024-11-16 19:00:55,502 INFO L226 Difference]: Without dead ends: 227 [2024-11-16 19:00:55,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-16 19:00:55,503 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 140 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:55,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 246 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 19:00:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-16 19:00:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-16 19:00:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 194 states have (on average 1.175257731958763) internal successors, (228), 196 states have internal predecessors, (228), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 19:00:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 284 transitions. [2024-11-16 19:00:55,564 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 284 transitions. Word has length 121 [2024-11-16 19:00:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:55,564 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 284 transitions. [2024-11-16 19:00:55,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 19:00:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 284 transitions. [2024-11-16 19:00:55,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 19:00:55,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:55,567 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:55,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 19:00:55,567 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:55,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1149246765, now seen corresponding path program 1 times [2024-11-16 19:00:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13015951] [2024-11-16 19:00:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:55,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:57,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:57,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13015951] [2024-11-16 19:00:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13015951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:57,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:57,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 19:00:57,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540827288] [2024-11-16 19:00:57,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:57,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 19:00:57,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:57,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 19:00:57,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-16 19:00:57,469 INFO L87 Difference]: Start difference. First operand 227 states and 284 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-16 19:00:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:58,068 INFO L93 Difference]: Finished difference Result 236 states and 294 transitions. [2024-11-16 19:00:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:00:58,069 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 121 [2024-11-16 19:00:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:58,071 INFO L225 Difference]: With dead ends: 236 [2024-11-16 19:00:58,071 INFO L226 Difference]: Without dead ends: 233 [2024-11-16 19:00:58,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-11-16 19:00:58,072 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 267 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:58,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 252 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 19:00:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-16 19:00:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-16 19:00:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 200 states have (on average 1.17) internal successors, (234), 202 states have internal predecessors, (234), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 19:00:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 290 transitions. [2024-11-16 19:00:58,131 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 290 transitions. Word has length 121 [2024-11-16 19:00:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:58,131 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 290 transitions. [2024-11-16 19:00:58,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-16 19:00:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 290 transitions. [2024-11-16 19:00:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 19:00:58,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:58,132 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:58,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 19:00:58,132 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:58,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash 622192721, now seen corresponding path program 1 times [2024-11-16 19:00:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:58,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857945967] [2024-11-16 19:00:58,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:58,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 19:00:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 19:00:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 19:00:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 19:00:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 19:00:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 19:00:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 19:00:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 19:00:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 19:00:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 19:00:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 19:00:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 19:00:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 19:00:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 19:00:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:00:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:00:59,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:00:59,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857945967] [2024-11-16 19:00:59,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857945967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:00:59,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:00:59,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 19:00:59,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467208581] [2024-11-16 19:00:59,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:00:59,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 19:00:59,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:00:59,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 19:00:59,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 19:00:59,239 INFO L87 Difference]: Start difference. First operand 233 states and 290 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 19:00:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:00:59,634 INFO L93 Difference]: Finished difference Result 433 states and 536 transitions. [2024-11-16 19:00:59,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:00:59,635 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-11-16 19:00:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:00:59,637 INFO L225 Difference]: With dead ends: 433 [2024-11-16 19:00:59,637 INFO L226 Difference]: Without dead ends: 233 [2024-11-16 19:00:59,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-16 19:00:59,638 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 308 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 19:00:59,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 164 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 19:00:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-16 19:00:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-16 19:00:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 200 states have (on average 1.16) internal successors, (232), 202 states have internal predecessors, (232), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 19:00:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 288 transitions. [2024-11-16 19:00:59,700 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 288 transitions. Word has length 121 [2024-11-16 19:00:59,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:00:59,701 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 288 transitions. [2024-11-16 19:00:59,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 19:00:59,701 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 288 transitions. [2024-11-16 19:00:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 19:00:59,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:00:59,703 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:00:59,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 19:00:59,703 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:00:59,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:00:59,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1095912475, now seen corresponding path program 1 times [2024-11-16 19:00:59,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:00:59,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532541978] [2024-11-16 19:00:59,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:00:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 19:00:59,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396566400] [2024-11-16 19:00:59,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:00:59,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:00:59,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:00:59,875 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) [2024-11-16 19:00:59,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 19:01:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:01:00,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-16 19:01:00,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:01:00,197 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 46 treesize of output 45 [2024-11-16 19:01:00,445 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 81 treesize of output 63 [2024-11-16 19:01:02,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:02,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:02,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2024-11-16 19:01:02,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:02,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:02,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:02,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:02,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:02,825 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-16 19:01:02,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 41 [2024-11-16 19:01:03,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:03,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:03,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:03,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:03,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:03,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:03,087 INFO L349 Elim1Store]: treesize reduction 64, result has 26.4 percent of original size [2024-11-16 19:01:03,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 63 [2024-11-16 19:01:03,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:03,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:03,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 27 [2024-11-16 19:01:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 19:01:03,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 19:01:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:01:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532541978] [2024-11-16 19:01:03,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 19:01:03,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396566400] [2024-11-16 19:01:03,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396566400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:01:03,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:01:03,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 19:01:03,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068621731] [2024-11-16 19:01:03,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:01:03,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 19:01:03,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:01:03,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 19:01:03,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-16 19:01:03,396 INFO L87 Difference]: Start difference. First operand 233 states and 288 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:01:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 19:01:04,606 INFO L93 Difference]: Finished difference Result 694 states and 837 transitions. [2024-11-16 19:01:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:01:04,606 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2024-11-16 19:01:04,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 19:01:04,609 INFO L225 Difference]: With dead ends: 694 [2024-11-16 19:01:04,609 INFO L226 Difference]: Without dead ends: 494 [2024-11-16 19:01:04,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-16 19:01:04,610 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 199 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 15 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 19:01:04,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 461 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 738 Invalid, 6 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 19:01:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-16 19:01:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 310. [2024-11-16 19:01:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 272 states have (on average 1.1727941176470589) internal successors, (319), 273 states have internal predecessors, (319), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 19:01:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 379 transitions. [2024-11-16 19:01:04,691 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 379 transitions. Word has length 122 [2024-11-16 19:01:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 19:01:04,691 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 379 transitions. [2024-11-16 19:01:04,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 19:01:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 379 transitions. [2024-11-16 19:01:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 19:01:04,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 19:01:04,693 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:01:04,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 19:01:04,893 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,SelfDestructingSolverStorable19 [2024-11-16 19:01:04,893 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:01:04,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:01:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash -860469906, now seen corresponding path program 1 times [2024-11-16 19:01:04,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:01:04,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866743457] [2024-11-16 19:01:04,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:01:04,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:01:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 19:01:04,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378703948] [2024-11-16 19:01:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:01:04,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:01:04,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:01:04,989 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) [2024-11-16 19:01:04,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 19:01:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:01:05,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-16 19:01:05,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:01:05,358 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 46 treesize of output 45 [2024-11-16 19:01:05,710 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 81 treesize of output 63 [2024-11-16 19:01:06,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 19:01:07,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 19:01:07,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 19:01:08,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 19:01:09,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 19:01:09,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 19:01:10,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,620 INFO L349 Elim1Store]: treesize reduction 181, result has 21.0 percent of original size [2024-11-16 19:01:10,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 161 [2024-11-16 19:01:10,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2024-11-16 19:01:10,726 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-16 19:01:10,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2024-11-16 19:01:10,892 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 51 treesize of output 35 [2024-11-16 19:01:10,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-11-16 19:01:10,921 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 62 treesize of output 42 [2024-11-16 19:01:10,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-16 19:01:10,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,957 INFO L349 Elim1Store]: treesize reduction 142, result has 0.7 percent of original size [2024-11-16 19:01:10,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 88 [2024-11-16 19:01:10,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:10,989 INFO L349 Elim1Store]: treesize reduction 142, result has 0.7 percent of original size [2024-11-16 19:01:10,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 88 [2024-11-16 19:01:11,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:11,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 19:01:11,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:11,211 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-16 19:01:11,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-16 19:01:11,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:11,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:11,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:11,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:11,357 INFO L349 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2024-11-16 19:01:11,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 58 [2024-11-16 19:01:11,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 19:01:11,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-16 19:01:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 113 proven. 120 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-16 19:01:11,541 INFO L311 TraceCheckSpWp]: Computing backward predicates...