./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:29:21,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:29:21,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:29:21,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:29:21,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:29:21,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:29:21,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:29:21,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:29:21,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:29:21,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:29:21,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:29:21,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:29:21,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:29:21,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:29:21,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:29:21,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:29:21,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:29:21,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:29:21,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:29:21,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:29:21,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:29:21,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:29:21,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:29:21,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:29:21,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:29:21,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:29:21,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:29:21,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:29:21,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:29:21,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:29:21,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:29:21,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:29:21,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:29:21,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:29:21,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:29:21,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:29:21,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:29:21,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:29:21,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:29:21,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:29:21,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:29:21,370 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:29:21,426 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:29:21,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:29:21,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:29:21,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:29:21,429 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:29:21,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:29:21,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:29:21,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:29:21,431 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:29:21,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:29:21,432 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:29:21,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:29:21,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:29:21,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:29:21,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:29:21,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:29:21,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:29:21,434 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:29:21,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:29:21,435 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:29:21,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:29:21,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:29:21,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:29:21,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:29:21,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:29:21,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:29:21,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:29:21,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:29:21,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:29:21,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:29:21,440 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:29:21,440 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:29:21,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:29:21,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd [2022-11-02 20:29:21,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:29:21,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:29:21,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:29:21,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:29:21,875 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:29:21,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-11-02 20:29:21,989 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/data/d483c1640/3b707f310a7b48c1be57ee0cc1f89925/FLAG30e11f0c5 [2022-11-02 20:29:22,799 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:29:22,799 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-11-02 20:29:22,826 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/data/d483c1640/3b707f310a7b48c1be57ee0cc1f89925/FLAG30e11f0c5 [2022-11-02 20:29:22,950 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/data/d483c1640/3b707f310a7b48c1be57ee0cc1f89925 [2022-11-02 20:29:22,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:29:22,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:29:22,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:29:22,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:29:22,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:29:22,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:29:22" (1/1) ... [2022-11-02 20:29:22,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd1ff9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:22, skipping insertion in model container [2022-11-02 20:29:22,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:29:22" (1/1) ... [2022-11-02 20:29:22,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:29:23,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:29:23,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2022-11-02 20:29:23,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2022-11-02 20:29:23,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2022-11-02 20:29:23,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2022-11-02 20:29:23,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2022-11-02 20:29:23,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2022-11-02 20:29:23,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2022-11-02 20:29:23,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2022-11-02 20:29:23,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2022-11-02 20:29:23,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2022-11-02 20:29:23,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2022-11-02 20:29:23,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2022-11-02 20:29:23,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2022-11-02 20:29:23,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2022-11-02 20:29:23,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2022-11-02 20:29:23,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2022-11-02 20:29:24,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:29:24,061 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:29:24,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2022-11-02 20:29:24,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2022-11-02 20:29:24,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2022-11-02 20:29:24,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2022-11-02 20:29:24,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2022-11-02 20:29:24,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2022-11-02 20:29:24,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2022-11-02 20:29:24,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2022-11-02 20:29:24,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2022-11-02 20:29:24,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2022-11-02 20:29:24,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2022-11-02 20:29:24,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2022-11-02 20:29:24,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2022-11-02 20:29:24,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2022-11-02 20:29:24,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2022-11-02 20:29:24,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2022-11-02 20:29:24,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:29:24,665 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:29:24,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24 WrapperNode [2022-11-02 20:29:24,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:29:24,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:29:24,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:29:24,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:29:24,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (1/1) ... [2022-11-02 20:29:24,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (1/1) ... [2022-11-02 20:29:24,874 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3340 [2022-11-02 20:29:24,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:29:24,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:29:24,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:29:24,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:29:24,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (1/1) ... [2022-11-02 20:29:24,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (1/1) ... [2022-11-02 20:29:24,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (1/1) ... [2022-11-02 20:29:24,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (1/1) ... [2022-11-02 20:29:24,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (1/1) ... [2022-11-02 20:29:24,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (1/1) ... [2022-11-02 20:29:25,006 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (1/1) ... [2022-11-02 20:29:25,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (1/1) ... [2022-11-02 20:29:25,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:29:25,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:29:25,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:29:25,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:29:25,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (1/1) ... [2022-11-02 20:29:25,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:29:25,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:29:25,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:29:25,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27acefdf-9bea-4368-a2b1-2b5f9f1d260e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:29:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:29:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:29:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:29:25,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:29:25,540 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:29:25,542 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:29:27,863 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:29:27,889 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:29:27,889 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:29:27,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:29:27 BoogieIcfgContainer [2022-11-02 20:29:27,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:29:27,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:29:27,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:29:27,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:29:27,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:29:22" (1/3) ... [2022-11-02 20:29:27,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac31e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:29:27, skipping insertion in model container [2022-11-02 20:29:27,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:24" (2/3) ... [2022-11-02 20:29:27,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac31e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:29:27, skipping insertion in model container [2022-11-02 20:29:27,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:29:27" (3/3) ... [2022-11-02 20:29:27,910 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-11-02 20:29:27,934 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:29:27,934 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-02 20:29:28,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:29:28,026 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@b497750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:29:28,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-02 20:29:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 626 states, 609 states have (on average 1.8505747126436782) internal successors, (1127), 625 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 20:29:28,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:28,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:28,083 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:28,090 INFO L85 PathProgramCache]: Analyzing trace with hash -50607350, now seen corresponding path program 1 times [2022-11-02 20:29:28,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:28,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925156232] [2022-11-02 20:29:28,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:28,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:28,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:28,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925156232] [2022-11-02 20:29:28,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925156232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:28,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:28,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:29:28,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288695355] [2022-11-02 20:29:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:28,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:29:28,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:29:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:29:28,992 INFO L87 Difference]: Start difference. First operand has 626 states, 609 states have (on average 1.8505747126436782) internal successors, (1127), 625 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:29,588 INFO L93 Difference]: Finished difference Result 971 states and 1686 transitions. [2022-11-02 20:29:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:29:29,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-11-02 20:29:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:29,623 INFO L225 Difference]: With dead ends: 971 [2022-11-02 20:29:29,623 INFO L226 Difference]: Without dead ends: 498 [2022-11-02 20:29:29,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:29:29,640 INFO L413 NwaCegarLoop]: 589 mSDtfsCounter, 2522 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2522 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:29,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2522 Valid, 603 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:29:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-11-02 20:29:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2022-11-02 20:29:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 482 states have (on average 1.3112033195020747) internal successors, (632), 497 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 632 transitions. [2022-11-02 20:29:29,764 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 632 transitions. Word has length 71 [2022-11-02 20:29:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:29,765 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 632 transitions. [2022-11-02 20:29:29,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 632 transitions. [2022-11-02 20:29:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 20:29:29,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:29,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:29,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:29:29,779 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:29,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash -329897172, now seen corresponding path program 1 times [2022-11-02 20:29:29,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:29,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016302988] [2022-11-02 20:29:29,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:29,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:30,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:30,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016302988] [2022-11-02 20:29:30,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016302988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:30,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:30,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:29:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360076756] [2022-11-02 20:29:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:30,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:29:30,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:30,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:29:30,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:29:30,125 INFO L87 Difference]: Start difference. First operand 498 states and 632 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:30,668 INFO L93 Difference]: Finished difference Result 834 states and 1087 transitions. [2022-11-02 20:29:30,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:29:30,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-11-02 20:29:30,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:30,672 INFO L225 Difference]: With dead ends: 834 [2022-11-02 20:29:30,672 INFO L226 Difference]: Without dead ends: 458 [2022-11-02 20:29:30,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:29:30,674 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 1614 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:30,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 328 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:29:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-02 20:29:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2022-11-02 20:29:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 442 states have (on average 1.3190045248868778) internal successors, (583), 457 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 583 transitions. [2022-11-02 20:29:30,706 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 583 transitions. Word has length 72 [2022-11-02 20:29:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:30,707 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 583 transitions. [2022-11-02 20:29:30,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 583 transitions. [2022-11-02 20:29:30,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-02 20:29:30,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:30,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:30,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:29:30,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:30,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1203518485, now seen corresponding path program 1 times [2022-11-02 20:29:30,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:30,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537162888] [2022-11-02 20:29:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:30,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:30,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537162888] [2022-11-02 20:29:30,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537162888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:30,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:30,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:29:30,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769193223] [2022-11-02 20:29:30,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:30,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:29:30,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:30,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:29:30,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:29:30,892 INFO L87 Difference]: Start difference. First operand 458 states and 583 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:31,330 INFO L93 Difference]: Finished difference Result 794 states and 1037 transitions. [2022-11-02 20:29:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:29:31,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-11-02 20:29:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:31,335 INFO L225 Difference]: With dead ends: 794 [2022-11-02 20:29:31,335 INFO L226 Difference]: Without dead ends: 426 [2022-11-02 20:29:31,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:29:31,340 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 1537 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:31,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 322 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:29:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-02 20:29:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-11-02 20:29:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 410 states have (on average 1.3317073170731708) internal successors, (546), 425 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:31,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 546 transitions. [2022-11-02 20:29:31,375 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 546 transitions. Word has length 73 [2022-11-02 20:29:31,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:31,376 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 546 transitions. [2022-11-02 20:29:31,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:31,377 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 546 transitions. [2022-11-02 20:29:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:29:31,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:31,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:31,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:29:31,384 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2052061875, now seen corresponding path program 1 times [2022-11-02 20:29:31,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:31,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234454984] [2022-11-02 20:29:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:31,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:31,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:31,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234454984] [2022-11-02 20:29:31,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234454984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:31,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:31,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:29:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692193747] [2022-11-02 20:29:31,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:31,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:29:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:31,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:29:31,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:29:31,612 INFO L87 Difference]: Start difference. First operand 426 states and 546 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:31,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:31,964 INFO L93 Difference]: Finished difference Result 762 states and 999 transitions. [2022-11-02 20:29:31,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:29:31,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-11-02 20:29:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:31,967 INFO L225 Difference]: With dead ends: 762 [2022-11-02 20:29:31,967 INFO L226 Difference]: Without dead ends: 401 [2022-11-02 20:29:31,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:29:31,969 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 1491 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:31,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 309 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:29:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-11-02 20:29:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2022-11-02 20:29:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3454545454545455) internal successors, (518), 400 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 518 transitions. [2022-11-02 20:29:32,037 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 518 transitions. Word has length 74 [2022-11-02 20:29:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:32,040 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 518 transitions. [2022-11-02 20:29:32,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 518 transitions. [2022-11-02 20:29:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 20:29:32,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:32,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:32,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:29:32,043 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1326375668, now seen corresponding path program 1 times [2022-11-02 20:29:32,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:32,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859278257] [2022-11-02 20:29:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:32,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:32,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859278257] [2022-11-02 20:29:32,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859278257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:32,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:32,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:29:32,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251960883] [2022-11-02 20:29:32,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:32,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:29:32,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:32,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:29:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:29:32,248 INFO L87 Difference]: Start difference. First operand 401 states and 518 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:32,588 INFO L93 Difference]: Finished difference Result 737 states and 970 transitions. [2022-11-02 20:29:32,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:29:32,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-11-02 20:29:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:32,590 INFO L225 Difference]: With dead ends: 737 [2022-11-02 20:29:32,590 INFO L226 Difference]: Without dead ends: 390 [2022-11-02 20:29:32,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:29:32,592 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 1435 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:32,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 304 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:29:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-02 20:29:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2022-11-02 20:29:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3502673796791445) internal successors, (505), 389 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 505 transitions. [2022-11-02 20:29:32,623 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 505 transitions. Word has length 75 [2022-11-02 20:29:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:32,623 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 505 transitions. [2022-11-02 20:29:32,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 505 transitions. [2022-11-02 20:29:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:29:32,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:32,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:32,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:29:32,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:32,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:32,626 INFO L85 PathProgramCache]: Analyzing trace with hash -976633234, now seen corresponding path program 1 times [2022-11-02 20:29:32,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:32,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875078691] [2022-11-02 20:29:32,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:32,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:32,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:32,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875078691] [2022-11-02 20:29:32,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875078691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:32,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:32,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:29:32,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611532164] [2022-11-02 20:29:32,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:32,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:29:32,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:32,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:29:32,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:29:32,990 INFO L87 Difference]: Start difference. First operand 390 states and 505 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:33,730 INFO L93 Difference]: Finished difference Result 754 states and 962 transitions. [2022-11-02 20:29:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:29:33,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-11-02 20:29:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:33,733 INFO L225 Difference]: With dead ends: 754 [2022-11-02 20:29:33,733 INFO L226 Difference]: Without dead ends: 542 [2022-11-02 20:29:33,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:29:33,735 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 2196 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2196 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:33,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2196 Valid, 805 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:29:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-11-02 20:29:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 390. [2022-11-02 20:29:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3475935828877006) internal successors, (504), 389 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 504 transitions. [2022-11-02 20:29:33,776 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 504 transitions. Word has length 76 [2022-11-02 20:29:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:33,776 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 504 transitions. [2022-11-02 20:29:33,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 504 transitions. [2022-11-02 20:29:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:29:33,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:33,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:33,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:29:33,778 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:33,779 INFO L85 PathProgramCache]: Analyzing trace with hash 649885335, now seen corresponding path program 1 times [2022-11-02 20:29:33,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:33,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525089812] [2022-11-02 20:29:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:34,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:34,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525089812] [2022-11-02 20:29:34,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525089812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:34,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:34,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:29:34,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178409429] [2022-11-02 20:29:34,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:34,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:29:34,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:29:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:29:34,336 INFO L87 Difference]: Start difference. First operand 390 states and 504 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:35,773 INFO L93 Difference]: Finished difference Result 904 states and 1205 transitions. [2022-11-02 20:29:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:29:35,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-11-02 20:29:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:35,777 INFO L225 Difference]: With dead ends: 904 [2022-11-02 20:29:35,777 INFO L226 Difference]: Without dead ends: 806 [2022-11-02 20:29:35,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:29:35,778 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 2763 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2763 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:35,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2763 Valid, 1860 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:29:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-11-02 20:29:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 393. [2022-11-02 20:29:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3448275862068966) internal successors, (507), 392 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 507 transitions. [2022-11-02 20:29:35,823 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 507 transitions. Word has length 76 [2022-11-02 20:29:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:35,824 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 507 transitions. [2022-11-02 20:29:35,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 507 transitions. [2022-11-02 20:29:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:29:35,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:35,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:35,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:29:35,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:35,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash 241040107, now seen corresponding path program 1 times [2022-11-02 20:29:35,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:35,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903841085] [2022-11-02 20:29:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:35,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:36,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:36,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903841085] [2022-11-02 20:29:36,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903841085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:36,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:36,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:29:36,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350360129] [2022-11-02 20:29:36,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:36,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:29:36,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:36,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:29:36,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:29:36,298 INFO L87 Difference]: Start difference. First operand 393 states and 507 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:37,745 INFO L93 Difference]: Finished difference Result 863 states and 1158 transitions. [2022-11-02 20:29:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:29:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-11-02 20:29:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:37,749 INFO L225 Difference]: With dead ends: 863 [2022-11-02 20:29:37,749 INFO L226 Difference]: Without dead ends: 735 [2022-11-02 20:29:37,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:29:37,750 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 2737 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2737 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:37,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2737 Valid, 2176 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:29:37,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-11-02 20:29:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 390. [2022-11-02 20:29:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3449197860962567) internal successors, (503), 389 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:37,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 503 transitions. [2022-11-02 20:29:37,803 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 503 transitions. Word has length 76 [2022-11-02 20:29:37,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:37,804 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 503 transitions. [2022-11-02 20:29:37,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:37,804 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 503 transitions. [2022-11-02 20:29:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:29:37,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:37,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:37,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:29:37,806 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:37,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1538930145, now seen corresponding path program 1 times [2022-11-02 20:29:37,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:37,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193065151] [2022-11-02 20:29:37,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:38,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193065151] [2022-11-02 20:29:38,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193065151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:38,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:38,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:29:38,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816768343] [2022-11-02 20:29:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:38,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:29:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:38,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:29:38,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:29:38,175 INFO L87 Difference]: Start difference. First operand 390 states and 503 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:39,397 INFO L93 Difference]: Finished difference Result 820 states and 1103 transitions. [2022-11-02 20:29:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:29:39,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-11-02 20:29:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:39,401 INFO L225 Difference]: With dead ends: 820 [2022-11-02 20:29:39,401 INFO L226 Difference]: Without dead ends: 731 [2022-11-02 20:29:39,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:29:39,404 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 2725 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2725 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:39,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2725 Valid, 1632 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:29:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-11-02 20:29:39,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 390. [2022-11-02 20:29:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3422459893048129) internal successors, (502), 389 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 502 transitions. [2022-11-02 20:29:39,460 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 502 transitions. Word has length 76 [2022-11-02 20:29:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:39,461 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 502 transitions. [2022-11-02 20:29:39,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 502 transitions. [2022-11-02 20:29:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:29:39,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:39,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:39,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:29:39,463 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:39,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash 684383254, now seen corresponding path program 1 times [2022-11-02 20:29:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:39,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124035786] [2022-11-02 20:29:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:40,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124035786] [2022-11-02 20:29:40,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124035786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:40,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:40,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:29:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380463824] [2022-11-02 20:29:40,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:40,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:29:40,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:40,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:29:40,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:29:40,146 INFO L87 Difference]: Start difference. First operand 390 states and 502 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:43,191 INFO L93 Difference]: Finished difference Result 1347 states and 1865 transitions. [2022-11-02 20:29:43,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:29:43,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-02 20:29:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:43,198 INFO L225 Difference]: With dead ends: 1347 [2022-11-02 20:29:43,198 INFO L226 Difference]: Without dead ends: 1249 [2022-11-02 20:29:43,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:29:43,199 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 4270 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4270 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:43,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4270 Valid, 2580 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-02 20:29:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2022-11-02 20:29:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 394. [2022-11-02 20:29:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3386243386243386) internal successors, (506), 393 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 506 transitions. [2022-11-02 20:29:43,279 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 506 transitions. Word has length 78 [2022-11-02 20:29:43,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:43,279 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 506 transitions. [2022-11-02 20:29:43,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 506 transitions. [2022-11-02 20:29:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:29:43,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:43,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:43,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:29:43,282 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:43,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash 275538026, now seen corresponding path program 1 times [2022-11-02 20:29:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:43,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959445281] [2022-11-02 20:29:43,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:43,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:43,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959445281] [2022-11-02 20:29:43,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959445281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:43,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:43,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:29:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469669089] [2022-11-02 20:29:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:43,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:29:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:43,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:29:43,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:29:43,651 INFO L87 Difference]: Start difference. First operand 394 states and 506 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:44,900 INFO L93 Difference]: Finished difference Result 803 states and 1071 transitions. [2022-11-02 20:29:44,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:29:44,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-02 20:29:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:44,903 INFO L225 Difference]: With dead ends: 803 [2022-11-02 20:29:44,903 INFO L226 Difference]: Without dead ends: 727 [2022-11-02 20:29:44,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:29:44,904 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 2873 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2873 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:44,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2873 Valid, 1496 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:29:44,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-11-02 20:29:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2022-11-02 20:29:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.335978835978836) internal successors, (505), 393 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 505 transitions. [2022-11-02 20:29:44,978 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 505 transitions. Word has length 78 [2022-11-02 20:29:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:44,978 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 505 transitions. [2022-11-02 20:29:44,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 505 transitions. [2022-11-02 20:29:44,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:29:44,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:44,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:44,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:29:44,983 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:44,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash 643640201, now seen corresponding path program 1 times [2022-11-02 20:29:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:44,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501952730] [2022-11-02 20:29:44,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:45,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:45,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501952730] [2022-11-02 20:29:45,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501952730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:45,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:45,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:29:45,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172817347] [2022-11-02 20:29:45,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:45,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:29:45,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:45,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:29:45,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:29:45,563 INFO L87 Difference]: Start difference. First operand 394 states and 505 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:48,213 INFO L93 Difference]: Finished difference Result 1219 states and 1675 transitions. [2022-11-02 20:29:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:29:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-02 20:29:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:48,218 INFO L225 Difference]: With dead ends: 1219 [2022-11-02 20:29:48,218 INFO L226 Difference]: Without dead ends: 1143 [2022-11-02 20:29:48,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:29:48,220 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 4352 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4352 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:48,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4352 Valid, 1942 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:29:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-11-02 20:29:48,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 398. [2022-11-02 20:29:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.3324607329842932) internal successors, (509), 397 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 509 transitions. [2022-11-02 20:29:48,308 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 509 transitions. Word has length 78 [2022-11-02 20:29:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:48,308 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 509 transitions. [2022-11-02 20:29:48,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 509 transitions. [2022-11-02 20:29:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:29:48,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:48,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:48,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:29:48,311 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:48,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1207054515, now seen corresponding path program 1 times [2022-11-02 20:29:48,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:48,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905020808] [2022-11-02 20:29:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:48,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:48,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905020808] [2022-11-02 20:29:48,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905020808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:48,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:48,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:29:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842392434] [2022-11-02 20:29:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:48,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:29:48,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:29:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:29:48,642 INFO L87 Difference]: Start difference. First operand 398 states and 509 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:49,915 INFO L93 Difference]: Finished difference Result 799 states and 1065 transitions. [2022-11-02 20:29:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:29:49,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-02 20:29:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:49,919 INFO L225 Difference]: With dead ends: 799 [2022-11-02 20:29:49,919 INFO L226 Difference]: Without dead ends: 727 [2022-11-02 20:29:49,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:29:49,920 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 2922 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2922 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:49,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2922 Valid, 1445 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:29:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-11-02 20:29:49,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 398. [2022-11-02 20:29:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.3298429319371727) internal successors, (508), 397 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 508 transitions. [2022-11-02 20:29:49,999 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 508 transitions. Word has length 78 [2022-11-02 20:29:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:49,999 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 508 transitions. [2022-11-02 20:29:49,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 508 transitions. [2022-11-02 20:29:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:29:50,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:50,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:50,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:29:50,001 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:50,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:50,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1808320783, now seen corresponding path program 1 times [2022-11-02 20:29:50,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:50,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496545724] [2022-11-02 20:29:50,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:50,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:50,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:50,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496545724] [2022-11-02 20:29:50,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496545724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:50,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:50,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:29:50,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133831929] [2022-11-02 20:29:50,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:50,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:29:50,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:50,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:29:50,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:29:50,431 INFO L87 Difference]: Start difference. First operand 398 states and 508 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:51,787 INFO L93 Difference]: Finished difference Result 842 states and 1112 transitions. [2022-11-02 20:29:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:29:51,788 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-02 20:29:51,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:51,791 INFO L225 Difference]: With dead ends: 842 [2022-11-02 20:29:51,791 INFO L226 Difference]: Without dead ends: 761 [2022-11-02 20:29:51,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:29:51,792 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 4070 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4070 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:51,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4070 Valid, 1615 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:29:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-11-02 20:29:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 405. [2022-11-02 20:29:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.3316195372750643) internal successors, (518), 404 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 518 transitions. [2022-11-02 20:29:51,868 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 518 transitions. Word has length 78 [2022-11-02 20:29:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:51,868 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 518 transitions. [2022-11-02 20:29:51,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 518 transitions. [2022-11-02 20:29:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:29:51,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:51,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:51,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:29:51,871 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:51,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:51,871 INFO L85 PathProgramCache]: Analyzing trace with hash 574449411, now seen corresponding path program 1 times [2022-11-02 20:29:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:51,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006164175] [2022-11-02 20:29:51,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:51,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:52,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:52,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006164175] [2022-11-02 20:29:52,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006164175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:52,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:52,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:29:52,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003507382] [2022-11-02 20:29:52,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:52,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:29:52,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:52,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:29:52,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:29:52,126 INFO L87 Difference]: Start difference. First operand 405 states and 518 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:53,390 INFO L93 Difference]: Finished difference Result 886 states and 1175 transitions. [2022-11-02 20:29:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:29:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-02 20:29:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:53,393 INFO L225 Difference]: With dead ends: 886 [2022-11-02 20:29:53,394 INFO L226 Difference]: Without dead ends: 743 [2022-11-02 20:29:53,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:29:53,395 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 2166 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:53,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 1797 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:29:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-11-02 20:29:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 398. [2022-11-02 20:29:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.3272251308900525) internal successors, (507), 397 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 507 transitions. [2022-11-02 20:29:53,496 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 507 transitions. Word has length 78 [2022-11-02 20:29:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:53,496 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 507 transitions. [2022-11-02 20:29:53,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 507 transitions. [2022-11-02 20:29:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:29:53,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:53,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:53,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:29:53,499 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:53,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash 688086315, now seen corresponding path program 1 times [2022-11-02 20:29:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:53,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209615137] [2022-11-02 20:29:53,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:53,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:53,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209615137] [2022-11-02 20:29:53,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209615137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:53,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:53,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:29:53,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533666268] [2022-11-02 20:29:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:53,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:29:53,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:53,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:29:53,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:29:53,815 INFO L87 Difference]: Start difference. First operand 398 states and 507 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:55,088 INFO L93 Difference]: Finished difference Result 803 states and 1066 transitions. [2022-11-02 20:29:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:29:55,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-02 20:29:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:55,092 INFO L225 Difference]: With dead ends: 803 [2022-11-02 20:29:55,092 INFO L226 Difference]: Without dead ends: 727 [2022-11-02 20:29:55,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:29:55,093 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 2901 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2901 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:55,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2901 Valid, 1466 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:29:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-11-02 20:29:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 398. [2022-11-02 20:29:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.324607329842932) internal successors, (506), 397 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 506 transitions. [2022-11-02 20:29:55,184 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 506 transitions. Word has length 78 [2022-11-02 20:29:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:55,184 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 506 transitions. [2022-11-02 20:29:55,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 506 transitions. [2022-11-02 20:29:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:29:55,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:55,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:55,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:29:55,187 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:55,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:55,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1096931543, now seen corresponding path program 1 times [2022-11-02 20:29:55,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:55,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005162862] [2022-11-02 20:29:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:55,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:55,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:55,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005162862] [2022-11-02 20:29:55,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005162862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:55,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:55,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:29:55,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097743889] [2022-11-02 20:29:55,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:55,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:29:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:55,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:29:55,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:29:55,428 INFO L87 Difference]: Start difference. First operand 398 states and 506 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:56,678 INFO L93 Difference]: Finished difference Result 833 states and 1107 transitions. [2022-11-02 20:29:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:29:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-02 20:29:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:56,682 INFO L225 Difference]: With dead ends: 833 [2022-11-02 20:29:56,682 INFO L226 Difference]: Without dead ends: 735 [2022-11-02 20:29:56,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:29:56,683 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 2029 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:56,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 1783 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:29:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-11-02 20:29:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 398. [2022-11-02 20:29:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.3219895287958114) internal successors, (505), 397 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 505 transitions. [2022-11-02 20:29:56,782 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 505 transitions. Word has length 78 [2022-11-02 20:29:56,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:56,783 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 505 transitions. [2022-11-02 20:29:56,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 505 transitions. [2022-11-02 20:29:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-02 20:29:56,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:56,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:56,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:29:56,785 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:56,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash 308307099, now seen corresponding path program 1 times [2022-11-02 20:29:56,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:56,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901546974] [2022-11-02 20:29:56,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:56,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:57,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:57,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901546974] [2022-11-02 20:29:57,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901546974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:57,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:57,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:29:57,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045382224] [2022-11-02 20:29:57,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:57,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:29:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:57,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:29:57,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:29:57,035 INFO L87 Difference]: Start difference. First operand 398 states and 505 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:58,379 INFO L93 Difference]: Finished difference Result 833 states and 1108 transitions. [2022-11-02 20:29:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:29:58,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-11-02 20:29:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:58,382 INFO L225 Difference]: With dead ends: 833 [2022-11-02 20:29:58,382 INFO L226 Difference]: Without dead ends: 735 [2022-11-02 20:29:58,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:29:58,383 INFO L413 NwaCegarLoop]: 505 mSDtfsCounter, 1381 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:58,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 1914 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:29:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-11-02 20:29:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2022-11-02 20:29:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3227513227513228) internal successors, (500), 393 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2022-11-02 20:29:58,495 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 79 [2022-11-02 20:29:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:58,496 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2022-11-02 20:29:58,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2022-11-02 20:29:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-02 20:29:58,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:58,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:58,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:29:58,498 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:29:58,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:58,499 INFO L85 PathProgramCache]: Analyzing trace with hash -754652965, now seen corresponding path program 1 times [2022-11-02 20:29:58,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:58,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063436149] [2022-11-02 20:29:58,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:58,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:58,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:58,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063436149] [2022-11-02 20:29:58,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063436149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:58,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:58,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:29:58,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302938267] [2022-11-02 20:29:58,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:58,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:29:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:58,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:29:58,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:29:58,750 INFO L87 Difference]: Start difference. First operand 394 states and 500 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:00,059 INFO L93 Difference]: Finished difference Result 799 states and 1059 transitions. [2022-11-02 20:30:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:00,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-11-02 20:30:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:00,062 INFO L225 Difference]: With dead ends: 799 [2022-11-02 20:30:00,063 INFO L226 Difference]: Without dead ends: 723 [2022-11-02 20:30:00,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:00,064 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 1608 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:00,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 1816 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:30:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-11-02 20:30:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 390. [2022-11-02 20:30:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3235294117647058) internal successors, (495), 389 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 495 transitions. [2022-11-02 20:30:00,153 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 495 transitions. Word has length 79 [2022-11-02 20:30:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:00,153 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 495 transitions. [2022-11-02 20:30:00,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 495 transitions. [2022-11-02 20:30:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:00,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:00,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:00,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:30:00,156 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:00,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1780834374, now seen corresponding path program 1 times [2022-11-02 20:30:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:00,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608960733] [2022-11-02 20:30:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:00,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:00,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:00,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608960733] [2022-11-02 20:30:00,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608960733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:00,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:00,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:00,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734040882] [2022-11-02 20:30:00,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:00,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:00,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:00,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:00,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:00,448 INFO L87 Difference]: Start difference. First operand 390 states and 495 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:01,911 INFO L93 Difference]: Finished difference Result 773 states and 1019 transitions. [2022-11-02 20:30:01,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:01,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:01,914 INFO L225 Difference]: With dead ends: 773 [2022-11-02 20:30:01,915 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:30:01,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:01,916 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 2247 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2247 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:01,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2247 Valid, 2075 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:30:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:30:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 390. [2022-11-02 20:30:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.320855614973262) internal successors, (494), 389 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 494 transitions. [2022-11-02 20:30:02,040 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 494 transitions. Word has length 80 [2022-11-02 20:30:02,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:02,040 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 494 transitions. [2022-11-02 20:30:02,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 494 transitions. [2022-11-02 20:30:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:02,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:02,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:02,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:30:02,042 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash 515089470, now seen corresponding path program 1 times [2022-11-02 20:30:02,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:02,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711539543] [2022-11-02 20:30:02,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:02,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:02,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711539543] [2022-11-02 20:30:02,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711539543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:02,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:02,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:30:02,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070519132] [2022-11-02 20:30:02,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:02,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:30:02,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:02,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:30:02,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:30:02,510 INFO L87 Difference]: Start difference. First operand 390 states and 494 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:05,217 INFO L93 Difference]: Finished difference Result 1105 states and 1498 transitions. [2022-11-02 20:30:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:30:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:05,220 INFO L225 Difference]: With dead ends: 1105 [2022-11-02 20:30:05,221 INFO L226 Difference]: Without dead ends: 1036 [2022-11-02 20:30:05,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:30:05,222 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 4824 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4824 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:05,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4824 Valid, 2100 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:30:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-11-02 20:30:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 394. [2022-11-02 20:30:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3174603174603174) internal successors, (498), 393 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 498 transitions. [2022-11-02 20:30:05,354 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 498 transitions. Word has length 80 [2022-11-02 20:30:05,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:05,355 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 498 transitions. [2022-11-02 20:30:05,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 498 transitions. [2022-11-02 20:30:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:05,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:05,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:05,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:30:05,357 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:05,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:05,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1270226045, now seen corresponding path program 1 times [2022-11-02 20:30:05,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:05,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21965254] [2022-11-02 20:30:05,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:05,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:05,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21965254] [2022-11-02 20:30:05,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21965254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:05,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:05,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:05,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639594358] [2022-11-02 20:30:05,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:05,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:05,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:05,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:05,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:05,644 INFO L87 Difference]: Start difference. First operand 394 states and 498 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:07,033 INFO L93 Difference]: Finished difference Result 776 states and 1020 transitions. [2022-11-02 20:30:07,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:07,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:07,038 INFO L225 Difference]: With dead ends: 776 [2022-11-02 20:30:07,038 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:30:07,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:07,039 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 2329 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2329 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:07,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2329 Valid, 1889 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:30:07,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:30:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 394. [2022-11-02 20:30:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3148148148148149) internal successors, (497), 393 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 497 transitions. [2022-11-02 20:30:07,162 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 497 transitions. Word has length 80 [2022-11-02 20:30:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:07,163 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 497 transitions. [2022-11-02 20:30:07,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 497 transitions. [2022-11-02 20:30:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:07,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:07,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:07,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:30:07,165 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:07,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1112544149, now seen corresponding path program 1 times [2022-11-02 20:30:07,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:07,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355106873] [2022-11-02 20:30:07,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:07,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:07,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:07,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355106873] [2022-11-02 20:30:07,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355106873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:07,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:07,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:07,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973680773] [2022-11-02 20:30:07,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:07,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:07,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:07,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:07,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:07,402 INFO L87 Difference]: Start difference. First operand 394 states and 497 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:08,857 INFO L93 Difference]: Finished difference Result 808 states and 1064 transitions. [2022-11-02 20:30:08,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:08,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:08,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:08,861 INFO L225 Difference]: With dead ends: 808 [2022-11-02 20:30:08,862 INFO L226 Difference]: Without dead ends: 727 [2022-11-02 20:30:08,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:08,863 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 2261 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2261 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:08,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2261 Valid, 1984 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:30:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-11-02 20:30:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2022-11-02 20:30:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.312169312169312) internal successors, (496), 393 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 496 transitions. [2022-11-02 20:30:08,982 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 496 transitions. Word has length 80 [2022-11-02 20:30:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:08,982 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 496 transitions. [2022-11-02 20:30:08,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 496 transitions. [2022-11-02 20:30:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:08,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:08,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:08,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:30:08,983 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash -955374417, now seen corresponding path program 1 times [2022-11-02 20:30:08,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:08,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985547469] [2022-11-02 20:30:08,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:08,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:09,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985547469] [2022-11-02 20:30:09,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985547469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:09,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:09,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126795823] [2022-11-02 20:30:09,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:09,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:09,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:09,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:09,265 INFO L87 Difference]: Start difference. First operand 394 states and 496 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:10,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:10,758 INFO L93 Difference]: Finished difference Result 773 states and 1015 transitions. [2022-11-02 20:30:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:10,759 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:10,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:10,762 INFO L225 Difference]: With dead ends: 773 [2022-11-02 20:30:10,762 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:30:10,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:10,763 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 2216 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:10,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2216 Valid, 2131 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:30:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:30:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 394. [2022-11-02 20:30:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3095238095238095) internal successors, (495), 393 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 495 transitions. [2022-11-02 20:30:10,877 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 495 transitions. Word has length 80 [2022-11-02 20:30:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:10,877 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 495 transitions. [2022-11-02 20:30:10,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 495 transitions. [2022-11-02 20:30:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:10,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:10,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:10,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:30:10,880 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:10,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:10,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2073965149, now seen corresponding path program 1 times [2022-11-02 20:30:10,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:10,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437016269] [2022-11-02 20:30:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:10,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:11,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:11,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437016269] [2022-11-02 20:30:11,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437016269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:11,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:11,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:30:11,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346693540] [2022-11-02 20:30:11,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:11,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:30:11,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:11,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:30:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:30:11,392 INFO L87 Difference]: Start difference. First operand 394 states and 495 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:14,099 INFO L93 Difference]: Finished difference Result 1041 states and 1397 transitions. [2022-11-02 20:30:14,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:30:14,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:14,103 INFO L225 Difference]: With dead ends: 1041 [2022-11-02 20:30:14,104 INFO L226 Difference]: Without dead ends: 1036 [2022-11-02 20:30:14,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:30:14,105 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 3963 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3963 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 2184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:14,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3963 Valid, 2024 Invalid, 2184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:30:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-11-02 20:30:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 398. [2022-11-02 20:30:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.306282722513089) internal successors, (499), 397 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 499 transitions. [2022-11-02 20:30:14,272 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 499 transitions. Word has length 80 [2022-11-02 20:30:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:14,272 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 499 transitions. [2022-11-02 20:30:14,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 499 transitions. [2022-11-02 20:30:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:14,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:14,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:14,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:30:14,274 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:14,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:14,275 INFO L85 PathProgramCache]: Analyzing trace with hash -306680341, now seen corresponding path program 1 times [2022-11-02 20:30:14,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:14,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500380403] [2022-11-02 20:30:14,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:14,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:14,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500380403] [2022-11-02 20:30:14,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500380403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:14,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:14,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:30:14,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616778011] [2022-11-02 20:30:14,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:14,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:30:14,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:14,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:30:14,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:30:14,745 INFO L87 Difference]: Start difference. First operand 398 states and 499 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:17,342 INFO L93 Difference]: Finished difference Result 1099 states and 1487 transitions. [2022-11-02 20:30:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:30:17,343 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:17,346 INFO L225 Difference]: With dead ends: 1099 [2022-11-02 20:30:17,347 INFO L226 Difference]: Without dead ends: 1033 [2022-11-02 20:30:17,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:30:17,348 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 4808 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4808 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:17,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4808 Valid, 1806 Invalid, 2028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:30:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-11-02 20:30:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 402. [2022-11-02 20:30:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 401 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 503 transitions. [2022-11-02 20:30:17,500 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 503 transitions. Word has length 80 [2022-11-02 20:30:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:17,501 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 503 transitions. [2022-11-02 20:30:17,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 503 transitions. [2022-11-02 20:30:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:17,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:17,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:17,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:30:17,503 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:17,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1961273491, now seen corresponding path program 1 times [2022-11-02 20:30:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607027120] [2022-11-02 20:30:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:17,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:17,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607027120] [2022-11-02 20:30:17,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607027120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:17,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:17,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:17,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924629740] [2022-11-02 20:30:17,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:17,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:17,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:17,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:17,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:17,790 INFO L87 Difference]: Start difference. First operand 402 states and 503 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:19,289 INFO L93 Difference]: Finished difference Result 771 states and 1010 transitions. [2022-11-02 20:30:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:19,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:19,291 INFO L225 Difference]: With dead ends: 771 [2022-11-02 20:30:19,292 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:30:19,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:19,297 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 2303 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2303 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:19,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2303 Valid, 1926 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:30:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:30:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 402. [2022-11-02 20:30:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.3005181347150259) internal successors, (502), 401 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 502 transitions. [2022-11-02 20:30:19,421 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 502 transitions. Word has length 80 [2022-11-02 20:30:19,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:19,421 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 502 transitions. [2022-11-02 20:30:19,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 502 transitions. [2022-11-02 20:30:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:19,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:19,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:19,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:30:19,423 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:19,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1780916949, now seen corresponding path program 1 times [2022-11-02 20:30:19,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:19,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018864199] [2022-11-02 20:30:19,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:19,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:19,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018864199] [2022-11-02 20:30:19,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018864199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:19,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:19,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:19,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501726129] [2022-11-02 20:30:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:19,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:19,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:19,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:19,650 INFO L87 Difference]: Start difference. First operand 402 states and 502 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:20,918 INFO L93 Difference]: Finished difference Result 820 states and 1071 transitions. [2022-11-02 20:30:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:20,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:20,921 INFO L225 Difference]: With dead ends: 820 [2022-11-02 20:30:20,921 INFO L226 Difference]: Without dead ends: 739 [2022-11-02 20:30:20,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:20,922 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 1871 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1871 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:20,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1871 Valid, 1605 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:30:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-11-02 20:30:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 402. [2022-11-02 20:30:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2979274611398963) internal successors, (501), 401 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 501 transitions. [2022-11-02 20:30:21,056 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 501 transitions. Word has length 80 [2022-11-02 20:30:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:21,057 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 501 transitions. [2022-11-02 20:30:21,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 501 transitions. [2022-11-02 20:30:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:21,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:21,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:21,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:30:21,059 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:21,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash 601853245, now seen corresponding path program 1 times [2022-11-02 20:30:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:21,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409974628] [2022-11-02 20:30:21,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:21,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:21,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409974628] [2022-11-02 20:30:21,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409974628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:21,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:21,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503383817] [2022-11-02 20:30:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:21,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:21,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:21,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:21,332 INFO L87 Difference]: Start difference. First operand 402 states and 501 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:22,784 INFO L93 Difference]: Finished difference Result 776 states and 1013 transitions. [2022-11-02 20:30:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:22,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:22,787 INFO L225 Difference]: With dead ends: 776 [2022-11-02 20:30:22,787 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:30:22,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:22,788 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 2275 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2275 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:22,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2275 Valid, 1977 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:30:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:30:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 402. [2022-11-02 20:30:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2953367875647668) internal successors, (500), 401 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 500 transitions. [2022-11-02 20:30:22,923 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 500 transitions. Word has length 80 [2022-11-02 20:30:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:22,923 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 500 transitions. [2022-11-02 20:30:22,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 500 transitions. [2022-11-02 20:30:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:22,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:22,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:22,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:30:22,925 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:22,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash -953833721, now seen corresponding path program 1 times [2022-11-02 20:30:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:22,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785771323] [2022-11-02 20:30:22,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:23,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785771323] [2022-11-02 20:30:23,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785771323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:23,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:23,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:23,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162799904] [2022-11-02 20:30:23,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:23,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:23,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:23,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:23,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:23,149 INFO L87 Difference]: Start difference. First operand 402 states and 500 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:24,604 INFO L93 Difference]: Finished difference Result 851 states and 1111 transitions. [2022-11-02 20:30:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:24,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:24,608 INFO L225 Difference]: With dead ends: 851 [2022-11-02 20:30:24,608 INFO L226 Difference]: Without dead ends: 747 [2022-11-02 20:30:24,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:24,609 INFO L413 NwaCegarLoop]: 505 mSDtfsCounter, 1842 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:24,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 1945 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:30:24,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-11-02 20:30:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 402. [2022-11-02 20:30:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2927461139896372) internal successors, (499), 401 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 499 transitions. [2022-11-02 20:30:24,731 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 499 transitions. Word has length 80 [2022-11-02 20:30:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:24,731 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 499 transitions. [2022-11-02 20:30:24,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 499 transitions. [2022-11-02 20:30:24,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:24,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:24,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:24,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:30:24,733 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:24,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:24,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1702835234, now seen corresponding path program 1 times [2022-11-02 20:30:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:24,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468246611] [2022-11-02 20:30:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:24,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:24,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:24,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468246611] [2022-11-02 20:30:24,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468246611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:24,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:24,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:24,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523689734] [2022-11-02 20:30:24,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:24,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:24,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:24,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:24,990 INFO L87 Difference]: Start difference. First operand 402 states and 499 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:26,514 INFO L93 Difference]: Finished difference Result 712 states and 915 transitions. [2022-11-02 20:30:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:26,517 INFO L225 Difference]: With dead ends: 712 [2022-11-02 20:30:26,517 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:30:26,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:26,519 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 2265 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2265 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:26,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2265 Valid, 1978 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:30:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:30:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 402. [2022-11-02 20:30:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2901554404145077) internal successors, (498), 401 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 498 transitions. [2022-11-02 20:30:26,651 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 498 transitions. Word has length 80 [2022-11-02 20:30:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:26,651 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 498 transitions. [2022-11-02 20:30:26,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 498 transitions. [2022-11-02 20:30:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:26,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:26,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:26,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:30:26,653 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash 209361868, now seen corresponding path program 1 times [2022-11-02 20:30:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:26,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892550204] [2022-11-02 20:30:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:26,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:26,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:26,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892550204] [2022-11-02 20:30:26,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892550204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:26,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:26,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:26,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091720056] [2022-11-02 20:30:26,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:26,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:26,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:26,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:26,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:26,860 INFO L87 Difference]: Start difference. First operand 402 states and 498 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:28,262 INFO L93 Difference]: Finished difference Result 756 states and 970 transitions. [2022-11-02 20:30:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:28,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:28,265 INFO L225 Difference]: With dead ends: 756 [2022-11-02 20:30:28,265 INFO L226 Difference]: Without dead ends: 739 [2022-11-02 20:30:28,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:28,266 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 2299 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2299 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:28,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2299 Valid, 1990 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:30:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-11-02 20:30:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 402. [2022-11-02 20:30:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2875647668393781) internal successors, (497), 401 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 497 transitions. [2022-11-02 20:30:28,387 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 497 transitions. Word has length 80 [2022-11-02 20:30:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:28,387 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 497 transitions. [2022-11-02 20:30:28,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 497 transitions. [2022-11-02 20:30:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:28,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:28,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:28,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:30:28,389 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1191963760, now seen corresponding path program 1 times [2022-11-02 20:30:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:28,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447834228] [2022-11-02 20:30:28,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:28,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:28,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447834228] [2022-11-02 20:30:28,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447834228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:28,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:28,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:28,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130986409] [2022-11-02 20:30:28,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:28,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:28,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:28,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:28,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:28,643 INFO L87 Difference]: Start difference. First operand 402 states and 497 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:30,151 INFO L93 Difference]: Finished difference Result 773 states and 1006 transitions. [2022-11-02 20:30:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:30,152 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:30,155 INFO L225 Difference]: With dead ends: 773 [2022-11-02 20:30:30,155 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:30:30,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:30,156 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 2236 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2236 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:30,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2236 Valid, 2029 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:30:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:30:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 402. [2022-11-02 20:30:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2849740932642486) internal successors, (496), 401 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 496 transitions. [2022-11-02 20:30:30,329 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 496 transitions. Word has length 80 [2022-11-02 20:30:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:30,329 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 496 transitions. [2022-11-02 20:30:30,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 496 transitions. [2022-11-02 20:30:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:30:30,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:30,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:30,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:30:30,331 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1836995487, now seen corresponding path program 1 times [2022-11-02 20:30:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:30,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700029782] [2022-11-02 20:30:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:30,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:30,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700029782] [2022-11-02 20:30:30,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700029782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:30,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:30,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:30:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806506910] [2022-11-02 20:30:30,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:30,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:30:30,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:30,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:30:30,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:30:30,729 INFO L87 Difference]: Start difference. First operand 402 states and 496 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:33,580 INFO L93 Difference]: Finished difference Result 1041 states and 1388 transitions. [2022-11-02 20:30:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:30:33,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-02 20:30:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:33,583 INFO L225 Difference]: With dead ends: 1041 [2022-11-02 20:30:33,583 INFO L226 Difference]: Without dead ends: 1036 [2022-11-02 20:30:33,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:30:33,584 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 3799 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3799 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:33,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3799 Valid, 2321 Invalid, 2249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:30:33,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-11-02 20:30:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 406. [2022-11-02 20:30:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 390 states have (on average 1.2820512820512822) internal successors, (500), 405 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 500 transitions. [2022-11-02 20:30:33,716 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 500 transitions. Word has length 80 [2022-11-02 20:30:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:33,716 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 500 transitions. [2022-11-02 20:30:33,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 500 transitions. [2022-11-02 20:30:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-02 20:30:33,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:33,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:33,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:30:33,718 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:33,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1478263256, now seen corresponding path program 1 times [2022-11-02 20:30:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:33,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410736021] [2022-11-02 20:30:33,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:33,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:33,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:33,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410736021] [2022-11-02 20:30:33,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410736021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:33,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:33,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367343859] [2022-11-02 20:30:33,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:33,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:33,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:33,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:33,953 INFO L87 Difference]: Start difference. First operand 406 states and 500 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:35,326 INFO L93 Difference]: Finished difference Result 776 states and 1007 transitions. [2022-11-02 20:30:35,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:35,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-11-02 20:30:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:35,328 INFO L225 Difference]: With dead ends: 776 [2022-11-02 20:30:35,329 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:30:35,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:35,330 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 2637 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2637 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:35,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2637 Valid, 1722 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:30:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:30:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 402. [2022-11-02 20:30:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.282383419689119) internal successors, (495), 401 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 495 transitions. [2022-11-02 20:30:35,449 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 495 transitions. Word has length 81 [2022-11-02 20:30:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:35,449 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 495 transitions. [2022-11-02 20:30:35,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 495 transitions. [2022-11-02 20:30:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-02 20:30:35,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:35,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:35,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:30:35,450 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash -397757345, now seen corresponding path program 1 times [2022-11-02 20:30:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:35,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056221330] [2022-11-02 20:30:35,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:35,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:35,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056221330] [2022-11-02 20:30:35,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056221330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:35,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:35,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:35,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208089267] [2022-11-02 20:30:35,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:35,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:35,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:35,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:35,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:35,669 INFO L87 Difference]: Start difference. First operand 402 states and 495 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:37,128 INFO L93 Difference]: Finished difference Result 712 states and 910 transitions. [2022-11-02 20:30:37,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:37,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-11-02 20:30:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:37,131 INFO L225 Difference]: With dead ends: 712 [2022-11-02 20:30:37,131 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:30:37,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:37,132 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 1810 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:37,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1810 Valid, 1779 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:30:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:30:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 398. [2022-11-02 20:30:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.2827225130890052) internal successors, (490), 397 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 490 transitions. [2022-11-02 20:30:37,265 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 490 transitions. Word has length 81 [2022-11-02 20:30:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:37,265 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 490 transitions. [2022-11-02 20:30:37,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 490 transitions. [2022-11-02 20:30:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-02 20:30:37,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:37,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:37,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:30:37,267 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:37,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:37,267 INFO L85 PathProgramCache]: Analyzing trace with hash 500388118, now seen corresponding path program 1 times [2022-11-02 20:30:37,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:37,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729496608] [2022-11-02 20:30:37,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:37,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:37,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:37,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729496608] [2022-11-02 20:30:37,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729496608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:37,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:37,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:37,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727196665] [2022-11-02 20:30:37,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:37,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:37,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:37,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:37,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:37,512 INFO L87 Difference]: Start difference. First operand 398 states and 490 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:38,931 INFO L93 Difference]: Finished difference Result 773 states and 1002 transitions. [2022-11-02 20:30:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:38,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-11-02 20:30:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:38,933 INFO L225 Difference]: With dead ends: 773 [2022-11-02 20:30:38,933 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:30:38,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:38,934 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 2394 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:38,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2394 Valid, 1777 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:30:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:30:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 394. [2022-11-02 20:30:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.283068783068783) internal successors, (485), 393 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 485 transitions. [2022-11-02 20:30:39,053 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 485 transitions. Word has length 81 [2022-11-02 20:30:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:39,053 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 485 transitions. [2022-11-02 20:30:39,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 485 transitions. [2022-11-02 20:30:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-02 20:30:39,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:39,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:39,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:30:39,055 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:39,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:39,055 INFO L85 PathProgramCache]: Analyzing trace with hash 846117342, now seen corresponding path program 1 times [2022-11-02 20:30:39,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:39,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999711974] [2022-11-02 20:30:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:39,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:39,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999711974] [2022-11-02 20:30:39,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999711974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:39,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:39,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:39,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087599530] [2022-11-02 20:30:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:39,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:39,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:39,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:39,295 INFO L87 Difference]: Start difference. First operand 394 states and 485 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:40,764 INFO L93 Difference]: Finished difference Result 712 states and 908 transitions. [2022-11-02 20:30:40,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:40,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-11-02 20:30:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:40,766 INFO L225 Difference]: With dead ends: 712 [2022-11-02 20:30:40,767 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:30:40,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:40,768 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 1792 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1792 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:40,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1792 Valid, 1795 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:30:40,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:30:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 390. [2022-11-02 20:30:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.2834224598930482) internal successors, (480), 389 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 480 transitions. [2022-11-02 20:30:40,917 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 480 transitions. Word has length 81 [2022-11-02 20:30:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:40,917 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 480 transitions. [2022-11-02 20:30:40,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:40,918 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 480 transitions. [2022-11-02 20:30:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-02 20:30:40,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:40,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:40,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:30:40,919 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:40,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1125287833, now seen corresponding path program 1 times [2022-11-02 20:30:40,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:40,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399002449] [2022-11-02 20:30:40,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:41,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:41,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399002449] [2022-11-02 20:30:41,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399002449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:41,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:41,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:30:41,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391693053] [2022-11-02 20:30:41,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:41,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:30:41,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:41,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:30:41,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:30:41,400 INFO L87 Difference]: Start difference. First operand 390 states and 480 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:42,987 INFO L93 Difference]: Finished difference Result 1027 states and 1321 transitions. [2022-11-02 20:30:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:30:42,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-11-02 20:30:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:42,990 INFO L225 Difference]: With dead ends: 1027 [2022-11-02 20:30:42,990 INFO L226 Difference]: Without dead ends: 846 [2022-11-02 20:30:42,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:30:42,991 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 2528 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2528 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:42,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2528 Valid, 2557 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:30:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-11-02 20:30:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 273. [2022-11-02 20:30:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 262 states have (on average 1.2709923664122138) internal successors, (333), 272 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 333 transitions. [2022-11-02 20:30:43,139 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 333 transitions. Word has length 82 [2022-11-02 20:30:43,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:43,139 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 333 transitions. [2022-11-02 20:30:43,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 333 transitions. [2022-11-02 20:30:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-02 20:30:43,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:43,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:43,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:30:43,140 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:43,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash 996849594, now seen corresponding path program 1 times [2022-11-02 20:30:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:43,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001978311] [2022-11-02 20:30:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:43,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:43,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001978311] [2022-11-02 20:30:43,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001978311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:43,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:43,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:30:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721002155] [2022-11-02 20:30:43,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:43,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:30:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:43,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:30:43,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:30:43,702 INFO L87 Difference]: Start difference. First operand 273 states and 333 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:45,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:45,252 INFO L93 Difference]: Finished difference Result 786 states and 1055 transitions. [2022-11-02 20:30:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:30:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-11-02 20:30:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:45,254 INFO L225 Difference]: With dead ends: 786 [2022-11-02 20:30:45,254 INFO L226 Difference]: Without dead ends: 689 [2022-11-02 20:30:45,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:30:45,255 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 2038 mSDsluCounter, 3103 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 3848 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:45,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2038 Valid, 3848 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:30:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-11-02 20:30:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 240. [2022-11-02 20:30:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 232 states have (on average 1.2629310344827587) internal successors, (293), 239 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 293 transitions. [2022-11-02 20:30:45,405 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 293 transitions. Word has length 82 [2022-11-02 20:30:45,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:45,405 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 293 transitions. [2022-11-02 20:30:45,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 293 transitions. [2022-11-02 20:30:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-02 20:30:45,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:45,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:45,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:30:45,407 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:45,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash 504555190, now seen corresponding path program 1 times [2022-11-02 20:30:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:45,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189201717] [2022-11-02 20:30:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:45,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:45,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:45,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189201717] [2022-11-02 20:30:45,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189201717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:45,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:45,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:30:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143659956] [2022-11-02 20:30:45,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:45,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:30:45,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:45,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:30:45,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:30:45,986 INFO L87 Difference]: Start difference. First operand 240 states and 293 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:47,498 INFO L93 Difference]: Finished difference Result 612 states and 786 transitions. [2022-11-02 20:30:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:47,499 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-11-02 20:30:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:47,500 INFO L225 Difference]: With dead ends: 612 [2022-11-02 20:30:47,500 INFO L226 Difference]: Without dead ends: 544 [2022-11-02 20:30:47,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:30:47,501 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 1754 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:47,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 2121 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:30:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-11-02 20:30:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 236. [2022-11-02 20:30:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 229 states have (on average 1.25764192139738) internal successors, (288), 235 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 288 transitions. [2022-11-02 20:30:47,615 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 288 transitions. Word has length 82 [2022-11-02 20:30:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:47,615 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 288 transitions. [2022-11-02 20:30:47,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 288 transitions. [2022-11-02 20:30:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-02 20:30:47,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:47,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:47,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:30:47,616 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:47,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1900616581, now seen corresponding path program 1 times [2022-11-02 20:30:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:47,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132326448] [2022-11-02 20:30:47,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:48,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132326448] [2022-11-02 20:30:48,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132326448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:48,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:48,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 20:30:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594789951] [2022-11-02 20:30:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:48,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:30:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:48,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:30:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:30:48,499 INFO L87 Difference]: Start difference. First operand 236 states and 288 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:50,948 INFO L93 Difference]: Finished difference Result 789 states and 1053 transitions. [2022-11-02 20:30:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:30:50,949 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-11-02 20:30:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:50,950 INFO L225 Difference]: With dead ends: 789 [2022-11-02 20:30:50,950 INFO L226 Difference]: Without dead ends: 666 [2022-11-02 20:30:50,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=275, Invalid=985, Unknown=0, NotChecked=0, Total=1260 [2022-11-02 20:30:50,951 INFO L413 NwaCegarLoop]: 593 mSDtfsCounter, 2015 mSDsluCounter, 4523 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2015 SdHoareTripleChecker+Valid, 5116 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:50,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2015 Valid, 5116 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:30:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-11-02 20:30:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 212. [2022-11-02 20:30:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2475728155339805) internal successors, (257), 211 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 257 transitions. [2022-11-02 20:30:51,072 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 257 transitions. Word has length 82 [2022-11-02 20:30:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:51,072 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 257 transitions. [2022-11-02 20:30:51,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 257 transitions. [2022-11-02 20:30:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:30:51,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:51,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:51,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:30:51,074 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash -823147502, now seen corresponding path program 1 times [2022-11-02 20:30:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:51,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767418620] [2022-11-02 20:30:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:51,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767418620] [2022-11-02 20:30:51,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767418620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:51,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:51,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:51,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498974312] [2022-11-02 20:30:51,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:51,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:51,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:51,324 INFO L87 Difference]: Start difference. First operand 212 states and 257 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:52,163 INFO L93 Difference]: Finished difference Result 322 states and 400 transitions. [2022-11-02 20:30:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:30:52,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-11-02 20:30:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:52,164 INFO L225 Difference]: With dead ends: 322 [2022-11-02 20:30:52,164 INFO L226 Difference]: Without dead ends: 315 [2022-11-02 20:30:52,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:30:52,165 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1127 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:52,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 845 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:30:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-02 20:30:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 212. [2022-11-02 20:30:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2427184466019416) internal successors, (256), 211 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 256 transitions. [2022-11-02 20:30:52,307 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 256 transitions. Word has length 83 [2022-11-02 20:30:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:52,307 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 256 transitions. [2022-11-02 20:30:52,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 256 transitions. [2022-11-02 20:30:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:30:52,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:52,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:52,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:30:52,309 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:52,310 INFO L85 PathProgramCache]: Analyzing trace with hash -892730834, now seen corresponding path program 1 times [2022-11-02 20:30:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:52,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654007322] [2022-11-02 20:30:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:52,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:52,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:52,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654007322] [2022-11-02 20:30:52,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654007322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:52,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:52,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:30:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943644432] [2022-11-02 20:30:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:52,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:30:52,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:52,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:30:52,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:52,533 INFO L87 Difference]: Start difference. First operand 212 states and 256 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:53,816 INFO L93 Difference]: Finished difference Result 527 states and 702 transitions. [2022-11-02 20:30:53,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:53,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-11-02 20:30:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:53,818 INFO L225 Difference]: With dead ends: 527 [2022-11-02 20:30:53,818 INFO L226 Difference]: Without dead ends: 445 [2022-11-02 20:30:53,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:30:53,821 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 813 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:53,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1037 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:30:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-11-02 20:30:54,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 212. [2022-11-02 20:30:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2378640776699028) internal successors, (255), 211 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 255 transitions. [2022-11-02 20:30:54,059 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 255 transitions. Word has length 83 [2022-11-02 20:30:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:54,059 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 255 transitions. [2022-11-02 20:30:54,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 255 transitions. [2022-11-02 20:30:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:30:54,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:54,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:54,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:30:54,064 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:54,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:54,065 INFO L85 PathProgramCache]: Analyzing trace with hash -993145316, now seen corresponding path program 1 times [2022-11-02 20:30:54,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:54,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628636757] [2022-11-02 20:30:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:54,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628636757] [2022-11-02 20:30:54,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628636757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:54,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:54,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:30:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098820894] [2022-11-02 20:30:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:54,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:30:54,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:54,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:30:54,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:30:54,807 INFO L87 Difference]: Start difference. First operand 212 states and 255 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:56,950 INFO L93 Difference]: Finished difference Result 495 states and 629 transitions. [2022-11-02 20:30:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:30:56,950 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-11-02 20:30:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:56,952 INFO L225 Difference]: With dead ends: 495 [2022-11-02 20:30:56,952 INFO L226 Difference]: Without dead ends: 491 [2022-11-02 20:30:56,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:30:56,953 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 1558 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:56,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 1906 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:30:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-11-02 20:30:57,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 208. [2022-11-02 20:30:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.2364532019704433) internal successors, (251), 207 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 251 transitions. [2022-11-02 20:30:57,102 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 251 transitions. Word has length 83 [2022-11-02 20:30:57,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:57,102 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 251 transitions. [2022-11-02 20:30:57,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 251 transitions. [2022-11-02 20:30:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:30:57,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:57,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:57,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:30:57,104 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2054330386, now seen corresponding path program 1 times [2022-11-02 20:30:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:57,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346399285] [2022-11-02 20:30:57,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:57,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:57,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346399285] [2022-11-02 20:30:57,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346399285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:57,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:57,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:30:57,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060895239] [2022-11-02 20:30:57,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:57,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:30:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:57,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:30:57,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:30:57,681 INFO L87 Difference]: Start difference. First operand 208 states and 251 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:59,193 INFO L93 Difference]: Finished difference Result 541 states and 707 transitions. [2022-11-02 20:30:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:30:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-11-02 20:30:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:59,195 INFO L225 Difference]: With dead ends: 541 [2022-11-02 20:30:59,195 INFO L226 Difference]: Without dead ends: 476 [2022-11-02 20:30:59,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:30:59,197 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 1566 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:59,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 2020 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:30:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-02 20:30:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 207. [2022-11-02 20:30:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2326732673267327) internal successors, (249), 206 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 249 transitions. [2022-11-02 20:30:59,332 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 249 transitions. Word has length 83 [2022-11-02 20:30:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:59,332 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 249 transitions. [2022-11-02 20:30:59,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 249 transitions. [2022-11-02 20:30:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:30:59,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:59,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:59,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:30:59,333 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:30:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:59,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1521304832, now seen corresponding path program 1 times [2022-11-02 20:30:59,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:59,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662516771] [2022-11-02 20:30:59,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:59,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:59,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:59,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662516771] [2022-11-02 20:30:59,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662516771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:59,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:59,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:30:59,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008007533] [2022-11-02 20:30:59,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:59,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:30:59,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:59,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:30:59,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:30:59,953 INFO L87 Difference]: Start difference. First operand 207 states and 249 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:01,487 INFO L93 Difference]: Finished difference Result 488 states and 632 transitions. [2022-11-02 20:31:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:31:01,488 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-11-02 20:31:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:01,489 INFO L225 Difference]: With dead ends: 488 [2022-11-02 20:31:01,489 INFO L226 Difference]: Without dead ends: 478 [2022-11-02 20:31:01,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:31:01,489 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 1146 mSDsluCounter, 2828 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:01,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 3381 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:31:01,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-11-02 20:31:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 197. [2022-11-02 20:31:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 193 states have (on average 1.233160621761658) internal successors, (238), 196 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 238 transitions. [2022-11-02 20:31:01,616 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 238 transitions. Word has length 83 [2022-11-02 20:31:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:01,616 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 238 transitions. [2022-11-02 20:31:01,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 238 transitions. [2022-11-02 20:31:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-02 20:31:01,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:01,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:01,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:31:01,618 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:01,618 INFO L85 PathProgramCache]: Analyzing trace with hash -7222703, now seen corresponding path program 1 times [2022-11-02 20:31:01,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:01,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749245095] [2022-11-02 20:31:01,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:01,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:02,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749245095] [2022-11-02 20:31:02,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749245095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:02,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:02,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:31:02,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208820190] [2022-11-02 20:31:02,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:02,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:31:02,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:02,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:31:02,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:31:02,041 INFO L87 Difference]: Start difference. First operand 197 states and 238 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:03,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:03,855 INFO L93 Difference]: Finished difference Result 472 states and 619 transitions. [2022-11-02 20:31:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:31:03,856 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-11-02 20:31:03,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:03,857 INFO L225 Difference]: With dead ends: 472 [2022-11-02 20:31:03,857 INFO L226 Difference]: Without dead ends: 465 [2022-11-02 20:31:03,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:31:03,858 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1796 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:03,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 974 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:31:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-11-02 20:31:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 201. [2022-11-02 20:31:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.2284263959390862) internal successors, (242), 200 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 242 transitions. [2022-11-02 20:31:03,995 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 242 transitions. Word has length 84 [2022-11-02 20:31:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:03,995 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 242 transitions. [2022-11-02 20:31:03,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 242 transitions. [2022-11-02 20:31:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-02 20:31:03,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:03,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:03,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 20:31:03,996 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:03,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1767300528, now seen corresponding path program 1 times [2022-11-02 20:31:03,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:03,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463791043] [2022-11-02 20:31:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:04,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:04,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463791043] [2022-11-02 20:31:04,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463791043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:04,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:04,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:31:04,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808962365] [2022-11-02 20:31:04,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:04,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:31:04,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:04,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:31:04,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:31:04,560 INFO L87 Difference]: Start difference. First operand 201 states and 242 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:06,586 INFO L93 Difference]: Finished difference Result 722 states and 980 transitions. [2022-11-02 20:31:06,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:31:06,586 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-11-02 20:31:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:06,588 INFO L225 Difference]: With dead ends: 722 [2022-11-02 20:31:06,588 INFO L226 Difference]: Without dead ends: 716 [2022-11-02 20:31:06,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:31:06,589 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 1570 mSDsluCounter, 3242 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 3718 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:06,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 3718 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:31:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-11-02 20:31:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 195. [2022-11-02 20:31:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 192 states have (on average 1.2291666666666667) internal successors, (236), 194 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 236 transitions. [2022-11-02 20:31:06,729 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 236 transitions. Word has length 85 [2022-11-02 20:31:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:06,730 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 236 transitions. [2022-11-02 20:31:06,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 236 transitions. [2022-11-02 20:31:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-02 20:31:06,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:06,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:06,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-02 20:31:06,731 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:06,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash 645292930, now seen corresponding path program 1 times [2022-11-02 20:31:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:06,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265895099] [2022-11-02 20:31:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:06,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:08,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:08,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265895099] [2022-11-02 20:31:08,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265895099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:08,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:08,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-11-02 20:31:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678798303] [2022-11-02 20:31:08,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:08,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 20:31:08,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:08,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 20:31:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:31:08,319 INFO L87 Difference]: Start difference. First operand 195 states and 236 transitions. Second operand has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:14,383 INFO L93 Difference]: Finished difference Result 741 states and 957 transitions. [2022-11-02 20:31:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:31:14,384 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-11-02 20:31:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:14,385 INFO L225 Difference]: With dead ends: 741 [2022-11-02 20:31:14,385 INFO L226 Difference]: Without dead ends: 733 [2022-11-02 20:31:14,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=365, Invalid=1891, Unknown=0, NotChecked=0, Total=2256 [2022-11-02 20:31:14,386 INFO L413 NwaCegarLoop]: 635 mSDtfsCounter, 2151 mSDsluCounter, 8531 mSDsCounter, 0 mSdLazyCounter, 4644 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 9166 SdHoareTripleChecker+Invalid, 4725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 4644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:14,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2151 Valid, 9166 Invalid, 4725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 4644 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 20:31:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-11-02 20:31:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 214. [2022-11-02 20:31:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 211 states have (on average 1.2274881516587677) internal successors, (259), 213 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 259 transitions. [2022-11-02 20:31:14,547 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 259 transitions. Word has length 85 [2022-11-02 20:31:14,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:14,547 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 259 transitions. [2022-11-02 20:31:14,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 259 transitions. [2022-11-02 20:31:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-02 20:31:14,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:14,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:14,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-02 20:31:14,549 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:14,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1708289536, now seen corresponding path program 1 times [2022-11-02 20:31:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:14,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368647040] [2022-11-02 20:31:14,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:14,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:14,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368647040] [2022-11-02 20:31:14,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368647040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:14,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:14,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:31:14,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585049544] [2022-11-02 20:31:14,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:14,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:31:14,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:14,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:31:14,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:31:14,745 INFO L87 Difference]: Start difference. First operand 214 states and 259 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:15,641 INFO L93 Difference]: Finished difference Result 310 states and 387 transitions. [2022-11-02 20:31:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:31:15,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-11-02 20:31:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:15,643 INFO L225 Difference]: With dead ends: 310 [2022-11-02 20:31:15,643 INFO L226 Difference]: Without dead ends: 303 [2022-11-02 20:31:15,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:31:15,644 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 498 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:15,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 825 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:31:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-02 20:31:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 210. [2022-11-02 20:31:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 207 states have (on average 1.2270531400966183) internal successors, (254), 209 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 254 transitions. [2022-11-02 20:31:15,799 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 254 transitions. Word has length 85 [2022-11-02 20:31:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:15,799 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 254 transitions. [2022-11-02 20:31:15,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 254 transitions. [2022-11-02 20:31:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-02 20:31:15,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:15,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:15,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-02 20:31:15,800 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:15,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1988293680, now seen corresponding path program 1 times [2022-11-02 20:31:15,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:15,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632968488] [2022-11-02 20:31:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:16,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632968488] [2022-11-02 20:31:16,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632968488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:16,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:16,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 20:31:16,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55484959] [2022-11-02 20:31:16,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:16,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:31:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:16,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:31:16,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:31:16,799 INFO L87 Difference]: Start difference. First operand 210 states and 254 transitions. Second operand has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:19,093 INFO L93 Difference]: Finished difference Result 404 states and 515 transitions. [2022-11-02 20:31:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:31:19,094 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-11-02 20:31:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:19,094 INFO L225 Difference]: With dead ends: 404 [2022-11-02 20:31:19,095 INFO L226 Difference]: Without dead ends: 396 [2022-11-02 20:31:19,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:31:19,095 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 1442 mSDsluCounter, 3308 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 3708 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:19,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 3708 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:31:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-11-02 20:31:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 191. [2022-11-02 20:31:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 188 states have (on average 1.2234042553191489) internal successors, (230), 190 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 230 transitions. [2022-11-02 20:31:19,255 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 230 transitions. Word has length 86 [2022-11-02 20:31:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:19,255 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 230 transitions. [2022-11-02 20:31:19,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 230 transitions. [2022-11-02 20:31:19,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-02 20:31:19,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:19,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:19,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 20:31:19,256 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:19,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:19,257 INFO L85 PathProgramCache]: Analyzing trace with hash -479136402, now seen corresponding path program 1 times [2022-11-02 20:31:19,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:19,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278198621] [2022-11-02 20:31:19,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:19,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:19,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:19,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278198621] [2022-11-02 20:31:19,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278198621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:19,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:19,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:31:19,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713916093] [2022-11-02 20:31:19,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:19,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:31:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:19,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:31:19,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:31:19,751 INFO L87 Difference]: Start difference. First operand 191 states and 230 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:21,106 INFO L93 Difference]: Finished difference Result 428 states and 568 transitions. [2022-11-02 20:31:21,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:31:21,106 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-11-02 20:31:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:21,107 INFO L225 Difference]: With dead ends: 428 [2022-11-02 20:31:21,107 INFO L226 Difference]: Without dead ends: 416 [2022-11-02 20:31:21,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:31:21,108 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 959 mSDsluCounter, 2345 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:21,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 2831 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:31:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-02 20:31:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 179. [2022-11-02 20:31:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.231638418079096) internal successors, (218), 178 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 218 transitions. [2022-11-02 20:31:21,265 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 218 transitions. Word has length 86 [2022-11-02 20:31:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:21,265 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 218 transitions. [2022-11-02 20:31:21,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 218 transitions. [2022-11-02 20:31:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-02 20:31:21,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:21,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:21,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-02 20:31:21,266 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1229983071, now seen corresponding path program 1 times [2022-11-02 20:31:21,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:21,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696694113] [2022-11-02 20:31:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:21,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:23,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:23,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696694113] [2022-11-02 20:31:23,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696694113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:23,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:23,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-11-02 20:31:23,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259203348] [2022-11-02 20:31:23,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:23,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:31:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:23,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:31:23,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:31:23,272 INFO L87 Difference]: Start difference. First operand 179 states and 218 transitions. Second operand has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:29,439 INFO L93 Difference]: Finished difference Result 582 states and 756 transitions. [2022-11-02 20:31:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:31:29,439 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-11-02 20:31:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:29,440 INFO L225 Difference]: With dead ends: 582 [2022-11-02 20:31:29,440 INFO L226 Difference]: Without dead ends: 574 [2022-11-02 20:31:29,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=441, Invalid=2315, Unknown=0, NotChecked=0, Total=2756 [2022-11-02 20:31:29,441 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 1792 mSDsluCounter, 6360 mSDsCounter, 0 mSdLazyCounter, 3647 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1792 SdHoareTripleChecker+Valid, 6838 SdHoareTripleChecker+Invalid, 3721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:29,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1792 Valid, 6838 Invalid, 3721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3647 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 20:31:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-11-02 20:31:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 199. [2022-11-02 20:31:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 198 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 241 transitions. [2022-11-02 20:31:29,642 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 241 transitions. Word has length 86 [2022-11-02 20:31:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:29,643 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 241 transitions. [2022-11-02 20:31:29,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 241 transitions. [2022-11-02 20:31:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-02 20:31:29,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:29,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:29,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-02 20:31:29,644 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:29,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1748334515, now seen corresponding path program 1 times [2022-11-02 20:31:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:29,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390737201] [2022-11-02 20:31:29,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:31,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:31,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390737201] [2022-11-02 20:31:31,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390737201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:31,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:31,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-11-02 20:31:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386123407] [2022-11-02 20:31:31,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:31,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 20:31:31,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:31,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 20:31:31,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:31:31,353 INFO L87 Difference]: Start difference. First operand 199 states and 241 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:36,589 INFO L93 Difference]: Finished difference Result 576 states and 750 transitions. [2022-11-02 20:31:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 20:31:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-11-02 20:31:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:36,591 INFO L225 Difference]: With dead ends: 576 [2022-11-02 20:31:36,591 INFO L226 Difference]: Without dead ends: 568 [2022-11-02 20:31:36,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=481, Invalid=1775, Unknown=0, NotChecked=0, Total=2256 [2022-11-02 20:31:36,594 INFO L413 NwaCegarLoop]: 505 mSDtfsCounter, 2024 mSDsluCounter, 6300 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2024 SdHoareTripleChecker+Valid, 6805 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:36,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2024 Valid, 6805 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 20:31:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-11-02 20:31:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 184. [2022-11-02 20:31:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 182 states have (on average 1.2252747252747254) internal successors, (223), 183 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 223 transitions. [2022-11-02 20:31:36,812 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 223 transitions. Word has length 87 [2022-11-02 20:31:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:36,812 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 223 transitions. [2022-11-02 20:31:36,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 223 transitions. [2022-11-02 20:31:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-02 20:31:36,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:36,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:36,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-02 20:31:36,813 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:36,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1516849940, now seen corresponding path program 1 times [2022-11-02 20:31:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:36,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622414488] [2022-11-02 20:31:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:36,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:37,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:37,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622414488] [2022-11-02 20:31:37,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622414488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:37,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:37,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:31:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872156245] [2022-11-02 20:31:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:37,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:31:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:37,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:31:37,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:31:37,312 INFO L87 Difference]: Start difference. First operand 184 states and 223 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:38,579 INFO L93 Difference]: Finished difference Result 457 states and 603 transitions. [2022-11-02 20:31:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:31:38,579 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-11-02 20:31:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:38,580 INFO L225 Difference]: With dead ends: 457 [2022-11-02 20:31:38,580 INFO L226 Difference]: Without dead ends: 428 [2022-11-02 20:31:38,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:31:38,581 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 1135 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:38,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 2214 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:31:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-11-02 20:31:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 155. [2022-11-02 20:31:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.2467532467532467) internal successors, (192), 154 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 192 transitions. [2022-11-02 20:31:38,739 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 192 transitions. Word has length 87 [2022-11-02 20:31:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:38,740 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 192 transitions. [2022-11-02 20:31:38,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 192 transitions. [2022-11-02 20:31:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 20:31:38,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:38,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:38,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 20:31:38,741 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 529887998, now seen corresponding path program 1 times [2022-11-02 20:31:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:38,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351773306] [2022-11-02 20:31:38,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:38,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:38,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:38,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351773306] [2022-11-02 20:31:38,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351773306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:38,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:38,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:31:38,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022034156] [2022-11-02 20:31:38,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:38,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:31:38,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:38,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:31:38,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:31:38,871 INFO L87 Difference]: Start difference. First operand 155 states and 192 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:40,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:40,253 INFO L93 Difference]: Finished difference Result 795 states and 1142 transitions. [2022-11-02 20:31:40,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:31:40,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-11-02 20:31:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:40,255 INFO L225 Difference]: With dead ends: 795 [2022-11-02 20:31:40,255 INFO L226 Difference]: Without dead ends: 731 [2022-11-02 20:31:40,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:31:40,256 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 1483 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:40,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1527 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:31:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-11-02 20:31:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 217. [2022-11-02 20:31:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.3148148148148149) internal successors, (284), 216 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2022-11-02 20:31:40,521 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 284 transitions. Word has length 112 [2022-11-02 20:31:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:40,521 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 284 transitions. [2022-11-02 20:31:40,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 284 transitions. [2022-11-02 20:31:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:31:40,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:40,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:40,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-02 20:31:40,522 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash 257111127, now seen corresponding path program 1 times [2022-11-02 20:31:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:40,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185664414] [2022-11-02 20:31:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:40,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:40,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185664414] [2022-11-02 20:31:40,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185664414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:40,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:40,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:31:40,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305399357] [2022-11-02 20:31:40,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:40,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:31:40,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:40,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:31:40,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:31:40,640 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:42,127 INFO L93 Difference]: Finished difference Result 911 states and 1312 transitions. [2022-11-02 20:31:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:31:42,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-11-02 20:31:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:42,129 INFO L225 Difference]: With dead ends: 911 [2022-11-02 20:31:42,129 INFO L226 Difference]: Without dead ends: 785 [2022-11-02 20:31:42,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:31:42,129 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 1186 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:42,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 954 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:31:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-11-02 20:31:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 341. [2022-11-02 20:31:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3794117647058823) internal successors, (469), 340 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 469 transitions. [2022-11-02 20:31:42,633 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 469 transitions. Word has length 114 [2022-11-02 20:31:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:42,634 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 469 transitions. [2022-11-02 20:31:42,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 469 transitions. [2022-11-02 20:31:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:31:42,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:42,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:42,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-02 20:31:42,635 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:42,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1982497248, now seen corresponding path program 1 times [2022-11-02 20:31:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:42,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775101275] [2022-11-02 20:31:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:42,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:42,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:42,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775101275] [2022-11-02 20:31:42,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775101275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:42,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:42,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:31:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057886139] [2022-11-02 20:31:42,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:42,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:31:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:31:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:31:42,836 INFO L87 Difference]: Start difference. First operand 341 states and 469 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:43,509 INFO L93 Difference]: Finished difference Result 593 states and 842 transitions. [2022-11-02 20:31:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:31:43,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-11-02 20:31:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:43,510 INFO L225 Difference]: With dead ends: 593 [2022-11-02 20:31:43,510 INFO L226 Difference]: Without dead ends: 343 [2022-11-02 20:31:43,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:31:43,511 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 605 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:43,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 552 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:31:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-02 20:31:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2022-11-02 20:31:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3735294117647059) internal successors, (467), 340 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 467 transitions. [2022-11-02 20:31:43,998 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 467 transitions. Word has length 114 [2022-11-02 20:31:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:43,999 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 467 transitions. [2022-11-02 20:31:43,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 467 transitions. [2022-11-02 20:31:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:31:44,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:44,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:44,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-02 20:31:44,000 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1242756927, now seen corresponding path program 1 times [2022-11-02 20:31:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:44,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974414534] [2022-11-02 20:31:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:44,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:44,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974414534] [2022-11-02 20:31:44,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974414534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:44,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:44,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:31:44,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047740452] [2022-11-02 20:31:44,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:44,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:44,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:44,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:44,047 INFO L87 Difference]: Start difference. First operand 341 states and 467 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:45,107 INFO L93 Difference]: Finished difference Result 815 states and 1163 transitions. [2022-11-02 20:31:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:45,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-11-02 20:31:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:45,109 INFO L225 Difference]: With dead ends: 815 [2022-11-02 20:31:45,109 INFO L226 Difference]: Without dead ends: 565 [2022-11-02 20:31:45,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:45,109 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 111 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:45,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 306 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:31:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-11-02 20:31:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 559. [2022-11-02 20:31:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3942652329749103) internal successors, (778), 558 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 778 transitions. [2022-11-02 20:31:46,051 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 778 transitions. Word has length 114 [2022-11-02 20:31:46,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:46,051 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 778 transitions. [2022-11-02 20:31:46,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 778 transitions. [2022-11-02 20:31:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:31:46,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:46,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:46,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-02 20:31:46,052 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:46,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:46,053 INFO L85 PathProgramCache]: Analyzing trace with hash 335311913, now seen corresponding path program 1 times [2022-11-02 20:31:46,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:46,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975526086] [2022-11-02 20:31:46,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:46,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:46,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:46,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975526086] [2022-11-02 20:31:46,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975526086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:46,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:46,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:31:46,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129425665] [2022-11-02 20:31:46,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:46,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:31:46,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:46,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:31:46,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:31:46,195 INFO L87 Difference]: Start difference. First operand 559 states and 778 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:49,530 INFO L93 Difference]: Finished difference Result 1853 states and 2658 transitions. [2022-11-02 20:31:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:31:49,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-11-02 20:31:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:49,534 INFO L225 Difference]: With dead ends: 1853 [2022-11-02 20:31:49,534 INFO L226 Difference]: Without dead ends: 1618 [2022-11-02 20:31:49,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:31:49,535 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 1110 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:49,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 996 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:31:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2022-11-02 20:31:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 909. [2022-11-02 20:31:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.4162995594713657) internal successors, (1286), 908 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1286 transitions. [2022-11-02 20:31:51,203 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1286 transitions. Word has length 114 [2022-11-02 20:31:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:51,203 INFO L495 AbstractCegarLoop]: Abstraction has 909 states and 1286 transitions. [2022-11-02 20:31:51,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1286 transitions. [2022-11-02 20:31:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:31:51,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:51,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:51,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-02 20:31:51,205 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:51,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash -784107677, now seen corresponding path program 1 times [2022-11-02 20:31:51,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:51,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665009732] [2022-11-02 20:31:51,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:51,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:51,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:51,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665009732] [2022-11-02 20:31:51,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665009732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:51,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:51,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:31:51,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232430250] [2022-11-02 20:31:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:51,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:31:51,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:51,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:31:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:31:51,321 INFO L87 Difference]: Start difference. First operand 909 states and 1286 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:55,748 INFO L93 Difference]: Finished difference Result 2086 states and 2997 transitions. [2022-11-02 20:31:55,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:31:55,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-11-02 20:31:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:31:55,752 INFO L225 Difference]: With dead ends: 2086 [2022-11-02 20:31:55,752 INFO L226 Difference]: Without dead ends: 1851 [2022-11-02 20:31:55,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:31:55,753 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 1003 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:31:55,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 1082 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:31:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2022-11-02 20:31:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1142. [2022-11-02 20:31:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1141 states have (on average 1.4241893076248904) internal successors, (1625), 1141 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1625 transitions. [2022-11-02 20:31:58,277 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1625 transitions. Word has length 114 [2022-11-02 20:31:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:31:58,277 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1625 transitions. [2022-11-02 20:31:58,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1625 transitions. [2022-11-02 20:31:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:31:58,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:31:58,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:58,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-02 20:31:58,279 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:31:58,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:58,280 INFO L85 PathProgramCache]: Analyzing trace with hash -651533795, now seen corresponding path program 1 times [2022-11-02 20:31:58,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:58,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215402877] [2022-11-02 20:31:58,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:58,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:58,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:58,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215402877] [2022-11-02 20:31:58,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215402877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:58,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:58,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:31:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409309171] [2022-11-02 20:31:58,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:58,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:31:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:31:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:31:58,411 INFO L87 Difference]: Start difference. First operand 1142 states and 1625 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:02,576 INFO L93 Difference]: Finished difference Result 2319 states and 3336 transitions. [2022-11-02 20:32:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:32:02,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-11-02 20:32:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:02,579 INFO L225 Difference]: With dead ends: 2319 [2022-11-02 20:32:02,579 INFO L226 Difference]: Without dead ends: 2084 [2022-11-02 20:32:02,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:32:02,580 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 1038 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:02,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1122 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:32:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2022-11-02 20:32:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1375. [2022-11-02 20:32:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1374 states have (on average 1.4294032023289664) internal successors, (1964), 1374 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1964 transitions. [2022-11-02 20:32:05,227 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1964 transitions. Word has length 114 [2022-11-02 20:32:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:05,227 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 1964 transitions. [2022-11-02 20:32:05,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1964 transitions. [2022-11-02 20:32:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 20:32:05,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:05,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:05,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-02 20:32:05,230 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:32:05,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:05,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1268705059, now seen corresponding path program 1 times [2022-11-02 20:32:05,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:05,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503241958] [2022-11-02 20:32:05,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:05,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:05,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503241958] [2022-11-02 20:32:05,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503241958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:05,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:05,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:32:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405632240] [2022-11-02 20:32:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:05,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:05,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:05,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:05,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:05,352 INFO L87 Difference]: Start difference. First operand 1375 states and 1964 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:11,042 INFO L93 Difference]: Finished difference Result 3855 states and 5544 transitions. [2022-11-02 20:32:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:11,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-11-02 20:32:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:11,047 INFO L225 Difference]: With dead ends: 3855 [2022-11-02 20:32:11,047 INFO L226 Difference]: Without dead ends: 2571 [2022-11-02 20:32:11,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:11,050 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 89 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:11,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:32:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-11-02 20:32:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2481. [2022-11-02 20:32:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.429032258064516) internal successors, (3544), 2480 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3544 transitions. [2022-11-02 20:32:16,104 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3544 transitions. Word has length 115 [2022-11-02 20:32:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:16,105 INFO L495 AbstractCegarLoop]: Abstraction has 2481 states and 3544 transitions. [2022-11-02 20:32:16,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3544 transitions. [2022-11-02 20:32:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-02 20:32:16,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:16,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:16,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-02 20:32:16,107 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:32:16,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:16,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1444283991, now seen corresponding path program 1 times [2022-11-02 20:32:16,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:16,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440244880] [2022-11-02 20:32:16,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:16,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:16,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:16,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440244880] [2022-11-02 20:32:16,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440244880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:16,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:16,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:32:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555100483] [2022-11-02 20:32:16,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:16,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:16,220 INFO L87 Difference]: Start difference. First operand 2481 states and 3544 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:25,949 INFO L93 Difference]: Finished difference Result 7085 states and 10130 transitions. [2022-11-02 20:32:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:25,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-11-02 20:32:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:25,956 INFO L225 Difference]: With dead ends: 7085 [2022-11-02 20:32:25,956 INFO L226 Difference]: Without dead ends: 4695 [2022-11-02 20:32:25,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:25,960 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 82 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:25,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:32:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2022-11-02 20:32:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 4517. [2022-11-02 20:32:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4517 states, 4516 states have (on average 1.421169176262179) internal successors, (6418), 4516 states have internal predecessors, (6418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6418 transitions. [2022-11-02 20:32:35,658 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6418 transitions. Word has length 116 [2022-11-02 20:32:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:35,658 INFO L495 AbstractCegarLoop]: Abstraction has 4517 states and 6418 transitions. [2022-11-02 20:32:35,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6418 transitions. [2022-11-02 20:32:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:32:35,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:35,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:35,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-02 20:32:35,659 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:32:35,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:35,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1913447474, now seen corresponding path program 1 times [2022-11-02 20:32:35,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:35,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161536523] [2022-11-02 20:32:35,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:35,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:35,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:35,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161536523] [2022-11-02 20:32:35,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161536523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:35,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:35,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:32:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333953825] [2022-11-02 20:32:35,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:35,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:35,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:35,735 INFO L87 Difference]: Start difference. First operand 4517 states and 6418 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)