./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-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_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/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_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/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_834da18d-e559-4e4e-ac5e-773abb8b154d/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 5a17c5e6b377f57a67eda09046c4807c6b84e7806fd109e4ef14e9498a7cb447 --- 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 21:10:52,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:10:52,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:10:52,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:10:52,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:10:52,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:10:52,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:10:52,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:10:52,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:10:52,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:10:52,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:10:52,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:10:52,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:10:52,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:10:52,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:10:52,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:10:52,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:10:52,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:10:52,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:10:52,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:10:52,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:10:52,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:10:52,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:10:52,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:10:52,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:10:52,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:10:52,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:10:52,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:10:52,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:10:52,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:10:52,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:10:52,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:10:52,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:10:52,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:10:52,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:10:52,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:10:52,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:10:52,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:10:52,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:10:52,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:10:52,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:10:52,556 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:10:52,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:10:52,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:10:52,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:10:52,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:10:52,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:10:52,579 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:10:52,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:10:52,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:10:52,580 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:10:52,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:10:52,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:10:52,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:10:52,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:10:52,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:10:52,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:10:52,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:10:52,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:10:52,582 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:10:52,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:10:52,582 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:10:52,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:10:52,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:10:52,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:10:52,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:10:52,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:10:52,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:10:52,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:10:52,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:10:52,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:10:52,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:10:52,584 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:10:52,585 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:10:52,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:10:52,585 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_834da18d-e559-4e4e-ac5e-773abb8b154d/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_834da18d-e559-4e4e-ac5e-773abb8b154d/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 -> 5a17c5e6b377f57a67eda09046c4807c6b84e7806fd109e4ef14e9498a7cb447 [2022-11-02 21:10:52,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:10:52,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:10:52,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:10:52,885 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:10:52,886 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:10:52,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2022-11-02 21:10:52,956 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/data/dd5be4691/b1a38c1d19594beb907ae3a4c99ca865/FLAGe3afa5c15 [2022-11-02 21:10:53,547 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:10:53,548 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2022-11-02 21:10:53,570 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/data/dd5be4691/b1a38c1d19594beb907ae3a4c99ca865/FLAGe3afa5c15 [2022-11-02 21:10:53,783 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/data/dd5be4691/b1a38c1d19594beb907ae3a4c99ca865 [2022-11-02 21:10:53,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:10:53,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:10:53,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:10:53,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:10:53,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:10:53,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:10:53" (1/1) ... [2022-11-02 21:10:53,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354a6e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:53, skipping insertion in model container [2022-11-02 21:10:53,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:10:53" (1/1) ... [2022-11-02 21:10:53,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:10:53,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:10:54,370 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16906,16919] [2022-11-02 21:10:54,407 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23310,23323] [2022-11-02 21:10:54,424 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26497,26510] [2022-11-02 21:10:54,442 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29453,29466] [2022-11-02 21:10:54,462 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33216,33229] [2022-11-02 21:10:54,485 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36248,36261] [2022-11-02 21:10:54,499 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39433,39446] [2022-11-02 21:10:54,511 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42384,42397] [2022-11-02 21:10:54,524 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45768,45781] [2022-11-02 21:10:54,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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48734,48747] [2022-11-02 21:10:54,549 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[51883,51896] [2022-11-02 21:10:54,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:10:54,607 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:10:54,730 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16906,16919] [2022-11-02 21:10:54,782 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23310,23323] [2022-11-02 21:10:54,808 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26497,26510] [2022-11-02 21:10:54,829 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29453,29466] [2022-11-02 21:10:54,845 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33216,33229] [2022-11-02 21:10:54,863 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36248,36261] [2022-11-02 21:10:54,873 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39433,39446] [2022-11-02 21:10:54,895 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42384,42397] [2022-11-02 21:10:54,906 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45768,45781] [2022-11-02 21:10:54,915 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48734,48747] [2022-11-02 21:10:54,925 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_834da18d-e559-4e4e-ac5e-773abb8b154d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[51883,51896] [2022-11-02 21:10:54,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:10:54,967 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:10:54,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54 WrapperNode [2022-11-02 21:10:54,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:10:54,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:10:54,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:10:54,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:10:54,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (1/1) ... [2022-11-02 21:10:55,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (1/1) ... [2022-11-02 21:10:55,097 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2571 [2022-11-02 21:10:55,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:10:55,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:10:55,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:10:55,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:10:55,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (1/1) ... [2022-11-02 21:10:55,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (1/1) ... [2022-11-02 21:10:55,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (1/1) ... [2022-11-02 21:10:55,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (1/1) ... [2022-11-02 21:10:55,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (1/1) ... [2022-11-02 21:10:55,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (1/1) ... [2022-11-02 21:10:55,184 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (1/1) ... [2022-11-02 21:10:55,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (1/1) ... [2022-11-02 21:10:55,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:10:55,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:10:55,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:10:55,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:10:55,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (1/1) ... [2022-11-02 21:10:55,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:10:55,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:55,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:10:55,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:10:55,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:10:55,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:10:55,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:10:55,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:10:55,432 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:10:55,434 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:10:57,268 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:10:57,279 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:10:57,279 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:10:57,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:10:57 BoogieIcfgContainer [2022-11-02 21:10:57,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:10:57,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:10:57,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:10:57,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:10:57,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:10:53" (1/3) ... [2022-11-02 21:10:57,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da32eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:10:57, skipping insertion in model container [2022-11-02 21:10:57,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:10:54" (2/3) ... [2022-11-02 21:10:57,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da32eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:10:57, skipping insertion in model container [2022-11-02 21:10:57,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:10:57" (3/3) ... [2022-11-02 21:10:57,291 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2022-11-02 21:10:57,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:10:57,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-02 21:10:57,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:10:57,377 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;@288870b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:10:57,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-02 21:10:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 537 states, 525 states have (on average 1.8304761904761904) internal successors, (961), 536 states have internal predecessors, (961), 0 states have call successors, (0), 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 21:10:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 21:10:57,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:57,401 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] [2022-11-02 21:10:57,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:10:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash 702631990, now seen corresponding path program 1 times [2022-11-02 21:10:57,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:57,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957993964] [2022-11-02 21:10:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:57,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:57,991 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 21:10:57,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:57,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957993964] [2022-11-02 21:10:57,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957993964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:57,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:57,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:10:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578412855] [2022-11-02 21:10:57,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:58,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:10:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:58,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:10:58,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:10:58,035 INFO L87 Difference]: Start difference. First operand has 537 states, 525 states have (on average 1.8304761904761904) internal successors, (961), 536 states have internal predecessors, (961), 0 states have call successors, (0), 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 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 21:10:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:58,759 INFO L93 Difference]: Finished difference Result 740 states and 1288 transitions. [2022-11-02 21:10:58,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:10:58,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-11-02 21:10:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:58,785 INFO L225 Difference]: With dead ends: 740 [2022-11-02 21:10:58,785 INFO L226 Difference]: Without dead ends: 470 [2022-11-02 21:10:58,793 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 21:10:58,799 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 2316 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:58,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 518 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:10:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-11-02 21:10:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-11-02 21:10:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 459 states have (on average 1.2962962962962963) internal successors, (595), 469 states have internal predecessors, (595), 0 states have call successors, (0), 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 21:10:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 595 transitions. [2022-11-02 21:10:58,906 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 595 transitions. Word has length 59 [2022-11-02 21:10:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:58,908 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 595 transitions. [2022-11-02 21:10:58,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 21:10:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 595 transitions. [2022-11-02 21:10:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 21:10:58,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:58,920 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] [2022-11-02 21:10:58,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:10:58,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:10:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash 728409025, now seen corresponding path program 1 times [2022-11-02 21:10:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:58,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954094489] [2022-11-02 21:10:58,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:58,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:59,138 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 21:10:59,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:59,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954094489] [2022-11-02 21:10:59,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954094489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:59,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:59,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:10:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014957757] [2022-11-02 21:10:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:59,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:10:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:59,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:10:59,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:10:59,148 INFO L87 Difference]: Start difference. First operand 470 states and 595 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 21:10:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:59,460 INFO L93 Difference]: Finished difference Result 600 states and 761 transitions. [2022-11-02 21:10:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:10:59,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-11-02 21:10:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:59,465 INFO L225 Difference]: With dead ends: 600 [2022-11-02 21:10:59,466 INFO L226 Difference]: Without dead ends: 356 [2022-11-02 21:10:59,469 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 21:10:59,470 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1295 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:59,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 243 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:10:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-11-02 21:10:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2022-11-02 21:10:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3101449275362318) internal successors, (452), 355 states have internal predecessors, (452), 0 states have call successors, (0), 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 21:10:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 452 transitions. [2022-11-02 21:10:59,508 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 452 transitions. Word has length 59 [2022-11-02 21:10:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:59,509 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 452 transitions. [2022-11-02 21:10:59,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 21:10:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 452 transitions. [2022-11-02 21:10:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 21:10:59,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:59,511 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] [2022-11-02 21:10:59,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:10:59,512 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:10:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:59,513 INFO L85 PathProgramCache]: Analyzing trace with hash -466198780, now seen corresponding path program 1 times [2022-11-02 21:10:59,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:59,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674758984] [2022-11-02 21:10:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:59,747 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 21:10:59,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:59,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674758984] [2022-11-02 21:10:59,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674758984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:59,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:59,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:10:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998961664] [2022-11-02 21:10:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:59,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:10:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:10:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:10:59,753 INFO L87 Difference]: Start difference. First operand 356 states and 452 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 21:11:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:00,001 INFO L93 Difference]: Finished difference Result 506 states and 651 transitions. [2022-11-02 21:11:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:11:00,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-11-02 21:11:00,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:00,003 INFO L225 Difference]: With dead ends: 506 [2022-11-02 21:11:00,003 INFO L226 Difference]: Without dead ends: 312 [2022-11-02 21:11:00,004 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 21:11:00,008 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 1153 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:00,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 219 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:11:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-11-02 21:11:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-11-02 21:11:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 301 states have (on average 1.3255813953488371) internal successors, (399), 311 states have internal predecessors, (399), 0 states have call successors, (0), 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 21:11:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 399 transitions. [2022-11-02 21:11:00,029 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 399 transitions. Word has length 59 [2022-11-02 21:11:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:00,031 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 399 transitions. [2022-11-02 21:11:00,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 21:11:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 399 transitions. [2022-11-02 21:11:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 21:11:00,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:00,033 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] [2022-11-02 21:11:00,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:11:00,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:00,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1447561490, now seen corresponding path program 1 times [2022-11-02 21:11:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:00,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821626790] [2022-11-02 21:11:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:00,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:00,241 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 21:11:00,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:00,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821626790] [2022-11-02 21:11:00,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821626790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:00,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:00,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:11:00,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089523314] [2022-11-02 21:11:00,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:00,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:11:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:00,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:00,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:11:00,249 INFO L87 Difference]: Start difference. First operand 312 states and 399 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 21:11:00,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:00,433 INFO L93 Difference]: Finished difference Result 410 states and 519 transitions. [2022-11-02 21:11:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:11:00,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-11-02 21:11:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:00,435 INFO L225 Difference]: With dead ends: 410 [2022-11-02 21:11:00,435 INFO L226 Difference]: Without dead ends: 245 [2022-11-02 21:11:00,436 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 21:11:00,438 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 855 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:00,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 195 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:11:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-02 21:11:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-11-02 21:11:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 244 states have internal predecessors, (309), 0 states have call successors, (0), 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 21:11:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 309 transitions. [2022-11-02 21:11:00,458 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 309 transitions. Word has length 60 [2022-11-02 21:11:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:00,460 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 309 transitions. [2022-11-02 21:11:00,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 21:11:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 309 transitions. [2022-11-02 21:11:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 21:11:00,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:00,465 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] [2022-11-02 21:11:00,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:11:00,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash -944801897, now seen corresponding path program 1 times [2022-11-02 21:11:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:00,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288268287] [2022-11-02 21:11:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:00,840 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 21:11:00,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:00,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288268287] [2022-11-02 21:11:00,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288268287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:00,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:00,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:00,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481887996] [2022-11-02 21:11:00,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:00,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:00,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:00,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:00,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:00,871 INFO L87 Difference]: Start difference. First operand 245 states and 309 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 21:11:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:01,620 INFO L93 Difference]: Finished difference Result 484 states and 632 transitions. [2022-11-02 21:11:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:11:01,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-11-02 21:11:01,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:01,624 INFO L225 Difference]: With dead ends: 484 [2022-11-02 21:11:01,626 INFO L226 Difference]: Without dead ends: 479 [2022-11-02 21:11:01,627 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 21:11:01,627 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 986 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:01,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 921 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:11:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-02 21:11:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 245. [2022-11-02 21:11:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 244 states have internal predecessors, (308), 0 states have call successors, (0), 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 21:11:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 308 transitions. [2022-11-02 21:11:01,658 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 308 transitions. Word has length 61 [2022-11-02 21:11:01,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:01,660 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 308 transitions. [2022-11-02 21:11:01,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 21:11:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 308 transitions. [2022-11-02 21:11:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 21:11:01,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:01,661 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] [2022-11-02 21:11:01,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:11:01,662 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:01,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:01,663 INFO L85 PathProgramCache]: Analyzing trace with hash 448084895, now seen corresponding path program 1 times [2022-11-02 21:11:01,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:01,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789253911] [2022-11-02 21:11:01,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:02,003 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 21:11:02,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:02,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789253911] [2022-11-02 21:11:02,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789253911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:02,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:02,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10736457] [2022-11-02 21:11:02,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:02,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:02,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:02,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:02,006 INFO L87 Difference]: Start difference. First operand 245 states and 308 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 21:11:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:02,811 INFO L93 Difference]: Finished difference Result 579 states and 770 transitions. [2022-11-02 21:11:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:11:02,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-11-02 21:11:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:02,814 INFO L225 Difference]: With dead ends: 579 [2022-11-02 21:11:02,814 INFO L226 Difference]: Without dead ends: 491 [2022-11-02 21:11:02,814 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 21:11:02,816 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 2047 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2047 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:02,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2047 Valid, 874 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:11:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-11-02 21:11:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 245. [2022-11-02 21:11:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.311965811965812) internal successors, (307), 244 states have internal predecessors, (307), 0 states have call successors, (0), 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 21:11:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 307 transitions. [2022-11-02 21:11:02,848 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 307 transitions. Word has length 61 [2022-11-02 21:11:02,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:02,849 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 307 transitions. [2022-11-02 21:11:02,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 21:11:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 307 transitions. [2022-11-02 21:11:02,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 21:11:02,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:02,850 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] [2022-11-02 21:11:02,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:11:02,850 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:02,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:02,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1014019097, now seen corresponding path program 1 times [2022-11-02 21:11:02,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:02,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119377834] [2022-11-02 21:11:02,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:02,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:03,098 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 21:11:03,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:03,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119377834] [2022-11-02 21:11:03,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119377834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:03,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:03,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:11:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294889637] [2022-11-02 21:11:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:03,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:11:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:03,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:11:03,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:11:03,101 INFO L87 Difference]: Start difference. First operand 245 states and 307 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 21:11:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:03,513 INFO L93 Difference]: Finished difference Result 484 states and 609 transitions. [2022-11-02 21:11:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:11:03,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-11-02 21:11:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:03,516 INFO L225 Difference]: With dead ends: 484 [2022-11-02 21:11:03,516 INFO L226 Difference]: Without dead ends: 351 [2022-11-02 21:11:03,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:11:03,517 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 1059 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:03,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 455 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:11:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-02 21:11:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 245. [2022-11-02 21:11:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 244 states have internal predecessors, (306), 0 states have call successors, (0), 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 21:11:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 306 transitions. [2022-11-02 21:11:03,547 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 306 transitions. Word has length 61 [2022-11-02 21:11:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:03,547 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 306 transitions. [2022-11-02 21:11:03,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 21:11:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 306 transitions. [2022-11-02 21:11:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:11:03,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:03,549 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] [2022-11-02 21:11:03,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:11:03,549 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash -471732578, now seen corresponding path program 1 times [2022-11-02 21:11:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:03,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085120380] [2022-11-02 21:11:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:03,876 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 21:11:03,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:03,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085120380] [2022-11-02 21:11:03,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085120380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:03,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:03,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:03,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100905119] [2022-11-02 21:11:03,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:03,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:03,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:03,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:03,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:03,879 INFO L87 Difference]: Start difference. First operand 245 states and 306 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:04,762 INFO L93 Difference]: Finished difference Result 504 states and 659 transitions. [2022-11-02 21:11:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:11:04,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-11-02 21:11:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:04,765 INFO L225 Difference]: With dead ends: 504 [2022-11-02 21:11:04,765 INFO L226 Difference]: Without dead ends: 487 [2022-11-02 21:11:04,766 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 21:11:04,767 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 1776 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:04,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 1043 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 21:11:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-02 21:11:04,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 245. [2022-11-02 21:11:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 244 states have internal predecessors, (305), 0 states have call successors, (0), 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 21:11:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 305 transitions. [2022-11-02 21:11:04,802 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 305 transitions. Word has length 63 [2022-11-02 21:11:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:04,802 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 305 transitions. [2022-11-02 21:11:04,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 305 transitions. [2022-11-02 21:11:04,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:11:04,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:04,804 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] [2022-11-02 21:11:04,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:11:04,804 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:04,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash -157878139, now seen corresponding path program 1 times [2022-11-02 21:11:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:04,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857495388] [2022-11-02 21:11:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:04,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:05,107 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 21:11:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:05,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857495388] [2022-11-02 21:11:05,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857495388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:05,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:05,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:05,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243490916] [2022-11-02 21:11:05,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:05,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:05,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:05,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:05,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:05,111 INFO L87 Difference]: Start difference. First operand 245 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:05,880 INFO L93 Difference]: Finished difference Result 484 states and 627 transitions. [2022-11-02 21:11:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:11:05,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-11-02 21:11:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:05,882 INFO L225 Difference]: With dead ends: 484 [2022-11-02 21:11:05,883 INFO L226 Difference]: Without dead ends: 479 [2022-11-02 21:11:05,883 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 21:11:05,885 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 941 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:05,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 976 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:11:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-02 21:11:05,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 245. [2022-11-02 21:11:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2991452991452992) internal successors, (304), 244 states have internal predecessors, (304), 0 states have call successors, (0), 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 21:11:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 304 transitions. [2022-11-02 21:11:05,956 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 304 transitions. Word has length 63 [2022-11-02 21:11:05,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:05,956 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 304 transitions. [2022-11-02 21:11:05,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 304 transitions. [2022-11-02 21:11:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:11:05,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:05,964 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] [2022-11-02 21:11:05,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:11:05,965 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:05,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2011079223, now seen corresponding path program 1 times [2022-11-02 21:11:05,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:05,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198839685] [2022-11-02 21:11:05,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:05,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:06,281 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 21:11:06,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:06,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198839685] [2022-11-02 21:11:06,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198839685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:06,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:06,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:06,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054984372] [2022-11-02 21:11:06,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:06,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:06,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:06,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:06,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:06,283 INFO L87 Difference]: Start difference. First operand 245 states and 304 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:07,069 INFO L93 Difference]: Finished difference Result 585 states and 769 transitions. [2022-11-02 21:11:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:11:07,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-11-02 21:11:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:07,071 INFO L225 Difference]: With dead ends: 585 [2022-11-02 21:11:07,072 INFO L226 Difference]: Without dead ends: 491 [2022-11-02 21:11:07,072 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 21:11:07,073 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 1853 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:07,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 1168 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:11:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-11-02 21:11:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 245. [2022-11-02 21:11:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.294871794871795) internal successors, (303), 244 states have internal predecessors, (303), 0 states have call successors, (0), 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 21:11:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 303 transitions. [2022-11-02 21:11:07,139 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 303 transitions. Word has length 63 [2022-11-02 21:11:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:07,139 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 303 transitions. [2022-11-02 21:11:07,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 303 transitions. [2022-11-02 21:11:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:11:07,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:07,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] [2022-11-02 21:11:07,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:11:07,141 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash 556986468, now seen corresponding path program 1 times [2022-11-02 21:11:07,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:07,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678246038] [2022-11-02 21:11:07,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:07,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:07,400 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 21:11:07,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:07,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678246038] [2022-11-02 21:11:07,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678246038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:07,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:07,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511015203] [2022-11-02 21:11:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:07,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:07,403 INFO L87 Difference]: Start difference. First operand 245 states and 303 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:08,288 INFO L93 Difference]: Finished difference Result 558 states and 737 transitions. [2022-11-02 21:11:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:11:08,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-11-02 21:11:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:08,290 INFO L225 Difference]: With dead ends: 558 [2022-11-02 21:11:08,291 INFO L226 Difference]: Without dead ends: 487 [2022-11-02 21:11:08,291 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 21:11:08,292 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 1789 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:08,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 1219 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 21:11:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-02 21:11:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 245. [2022-11-02 21:11:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2905982905982907) internal successors, (302), 244 states have internal predecessors, (302), 0 states have call successors, (0), 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 21:11:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 302 transitions. [2022-11-02 21:11:08,334 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 302 transitions. Word has length 63 [2022-11-02 21:11:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:08,335 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 302 transitions. [2022-11-02 21:11:08,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 302 transitions. [2022-11-02 21:11:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:11:08,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:08,336 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] [2022-11-02 21:11:08,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:11:08,337 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash -33472501, now seen corresponding path program 1 times [2022-11-02 21:11:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:08,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907721394] [2022-11-02 21:11:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:08,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:08,617 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 21:11:08,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:08,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907721394] [2022-11-02 21:11:08,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907721394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:08,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:08,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:08,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965524687] [2022-11-02 21:11:08,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:08,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:08,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:08,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:08,620 INFO L87 Difference]: Start difference. First operand 245 states and 302 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:09,405 INFO L93 Difference]: Finished difference Result 538 states and 705 transitions. [2022-11-02 21:11:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:11:09,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-11-02 21:11:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:09,407 INFO L225 Difference]: With dead ends: 538 [2022-11-02 21:11:09,408 INFO L226 Difference]: Without dead ends: 479 [2022-11-02 21:11:09,408 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 21:11:09,409 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 1297 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:09,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 1027 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:11:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-02 21:11:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 245. [2022-11-02 21:11:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2863247863247864) internal successors, (301), 244 states have internal predecessors, (301), 0 states have call successors, (0), 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 21:11:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 301 transitions. [2022-11-02 21:11:09,449 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 301 transitions. Word has length 63 [2022-11-02 21:11:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:09,449 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 301 transitions. [2022-11-02 21:11:09,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 301 transitions. [2022-11-02 21:11:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:11:09,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:09,451 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] [2022-11-02 21:11:09,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:11:09,451 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:09,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:09,452 INFO L85 PathProgramCache]: Analyzing trace with hash 543767036, now seen corresponding path program 1 times [2022-11-02 21:11:09,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:09,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174726651] [2022-11-02 21:11:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:09,664 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 21:11:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:09,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174726651] [2022-11-02 21:11:09,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174726651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:09,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:09,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424134599] [2022-11-02 21:11:09,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:09,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:09,667 INFO L87 Difference]: Start difference. First operand 245 states and 301 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:10,456 INFO L93 Difference]: Finished difference Result 535 states and 701 transitions. [2022-11-02 21:11:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:11:10,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-11-02 21:11:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:10,459 INFO L225 Difference]: With dead ends: 535 [2022-11-02 21:11:10,459 INFO L226 Difference]: Without dead ends: 479 [2022-11-02 21:11:10,460 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 21:11:10,461 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 1327 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:10,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 995 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:11:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-02 21:11:10,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 245. [2022-11-02 21:11:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2820512820512822) internal successors, (300), 244 states have internal predecessors, (300), 0 states have call successors, (0), 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 21:11:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 300 transitions. [2022-11-02 21:11:10,524 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 300 transitions. Word has length 63 [2022-11-02 21:11:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:10,525 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 300 transitions. [2022-11-02 21:11:10,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 300 transitions. [2022-11-02 21:11:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:11:10,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:10,527 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] [2022-11-02 21:11:10,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:11:10,528 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:10,529 INFO L85 PathProgramCache]: Analyzing trace with hash -130251118, now seen corresponding path program 1 times [2022-11-02 21:11:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:10,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832062381] [2022-11-02 21:11:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:10,809 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 21:11:10,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:10,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832062381] [2022-11-02 21:11:10,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832062381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:10,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:10,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:10,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934535365] [2022-11-02 21:11:10,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:10,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:10,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:10,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:10,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:10,812 INFO L87 Difference]: Start difference. First operand 245 states and 300 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:11,721 INFO L93 Difference]: Finished difference Result 553 states and 726 transitions. [2022-11-02 21:11:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:11:11,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-11-02 21:11:11,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:11,723 INFO L225 Difference]: With dead ends: 553 [2022-11-02 21:11:11,723 INFO L226 Difference]: Without dead ends: 487 [2022-11-02 21:11:11,724 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 21:11:11,725 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 1652 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:11,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 1138 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 21:11:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-02 21:11:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 245. [2022-11-02 21:11:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2777777777777777) internal successors, (299), 244 states have internal predecessors, (299), 0 states have call successors, (0), 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 21:11:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 299 transitions. [2022-11-02 21:11:11,767 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 299 transitions. Word has length 63 [2022-11-02 21:11:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:11,767 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 299 transitions. [2022-11-02 21:11:11,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:11:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 299 transitions. [2022-11-02 21:11:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:11:11,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:11,768 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] [2022-11-02 21:11:11,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:11:11,769 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:11,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2022048839, now seen corresponding path program 1 times [2022-11-02 21:11:11,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:11,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994077306] [2022-11-02 21:11:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:11,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:13,222 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 21:11:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:13,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994077306] [2022-11-02 21:11:13,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994077306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:13,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:13,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-02 21:11:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653837070] [2022-11-02 21:11:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:13,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 21:11:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 21:11:13,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:11:13,225 INFO L87 Difference]: Start difference. First operand 245 states and 299 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 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 21:11:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:18,683 INFO L93 Difference]: Finished difference Result 766 states and 951 transitions. [2022-11-02 21:11:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 21:11:18,686 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-11-02 21:11:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:18,692 INFO L225 Difference]: With dead ends: 766 [2022-11-02 21:11:18,693 INFO L226 Difference]: Without dead ends: 754 [2022-11-02 21:11:18,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=320, Invalid=1572, Unknown=0, NotChecked=0, Total=1892 [2022-11-02 21:11:18,696 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 2293 mSDsluCounter, 8117 mSDsCounter, 0 mSdLazyCounter, 4619 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2293 SdHoareTripleChecker+Valid, 8767 SdHoareTripleChecker+Invalid, 4717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:18,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2293 Valid, 8767 Invalid, 4717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4619 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-02 21:11:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-11-02 21:11:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 260. [2022-11-02 21:11:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 249 states have (on average 1.2771084337349397) internal successors, (318), 259 states have internal predecessors, (318), 0 states have call successors, (0), 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 21:11:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 318 transitions. [2022-11-02 21:11:18,748 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 318 transitions. Word has length 65 [2022-11-02 21:11:18,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:18,748 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 318 transitions. [2022-11-02 21:11:18,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 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 21:11:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 318 transitions. [2022-11-02 21:11:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:11:18,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:18,749 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] [2022-11-02 21:11:18,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:11:18,750 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:18,750 INFO L85 PathProgramCache]: Analyzing trace with hash 71013216, now seen corresponding path program 1 times [2022-11-02 21:11:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:18,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438744504] [2022-11-02 21:11:18,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:18,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:19,911 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 21:11:19,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:19,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438744504] [2022-11-02 21:11:19,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438744504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:19,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:19,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-02 21:11:19,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133682878] [2022-11-02 21:11:19,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:19,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 21:11:19,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:19,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 21:11:19,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:11:19,913 INFO L87 Difference]: Start difference. First operand 260 states and 318 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 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 21:11:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:24,350 INFO L93 Difference]: Finished difference Result 806 states and 1017 transitions. [2022-11-02 21:11:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 21:11:24,350 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-11-02 21:11:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:24,353 INFO L225 Difference]: With dead ends: 806 [2022-11-02 21:11:24,353 INFO L226 Difference]: Without dead ends: 745 [2022-11-02 21:11:24,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=280, Invalid=1442, Unknown=0, NotChecked=0, Total=1722 [2022-11-02 21:11:24,355 INFO L413 NwaCegarLoop]: 628 mSDtfsCounter, 2122 mSDsluCounter, 7873 mSDsCounter, 0 mSdLazyCounter, 4573 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 8501 SdHoareTripleChecker+Invalid, 4662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 4573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:24,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 8501 Invalid, 4662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 4573 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-02 21:11:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-11-02 21:11:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 265. [2022-11-02 21:11:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 254 states have (on average 1.2755905511811023) internal successors, (324), 264 states have internal predecessors, (324), 0 states have call successors, (0), 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 21:11:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 324 transitions. [2022-11-02 21:11:24,416 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 324 transitions. Word has length 65 [2022-11-02 21:11:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:24,417 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 324 transitions. [2022-11-02 21:11:24,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 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 21:11:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 324 transitions. [2022-11-02 21:11:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:11:24,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:24,418 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] [2022-11-02 21:11:24,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:11:24,419 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:24,419 INFO L85 PathProgramCache]: Analyzing trace with hash -907607662, now seen corresponding path program 1 times [2022-11-02 21:11:24,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:24,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916624849] [2022-11-02 21:11:24,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:24,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,963 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 21:11:24,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:24,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916624849] [2022-11-02 21:11:24,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916624849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:24,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:24,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 21:11:24,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276461628] [2022-11-02 21:11:24,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:24,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:11:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:24,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:11:24,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:11:24,965 INFO L87 Difference]: Start difference. First operand 265 states and 324 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 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 21:11:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:26,284 INFO L93 Difference]: Finished difference Result 687 states and 917 transitions. [2022-11-02 21:11:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:11:26,285 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-11-02 21:11:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:26,287 INFO L225 Difference]: With dead ends: 687 [2022-11-02 21:11:26,287 INFO L226 Difference]: Without dead ends: 617 [2022-11-02 21:11:26,288 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 21:11:26,289 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 1541 mSDsluCounter, 2924 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:26,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 3598 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 21:11:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-02 21:11:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 249. [2022-11-02 21:11:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 240 states have (on average 1.2708333333333333) internal successors, (305), 248 states have internal predecessors, (305), 0 states have call successors, (0), 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 21:11:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 305 transitions. [2022-11-02 21:11:26,365 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 305 transitions. Word has length 65 [2022-11-02 21:11:26,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:26,366 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 305 transitions. [2022-11-02 21:11:26,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 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 21:11:26,366 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 305 transitions. [2022-11-02 21:11:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:11:26,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:26,367 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] [2022-11-02 21:11:26,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:11:26,368 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:26,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1360022849, now seen corresponding path program 1 times [2022-11-02 21:11:26,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:26,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419139407] [2022-11-02 21:11:26,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:26,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:26,885 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 21:11:26,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:26,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419139407] [2022-11-02 21:11:26,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419139407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:26,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:26,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 21:11:26,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179846821] [2022-11-02 21:11:26,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:26,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:11:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:26,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:11:26,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:11:26,887 INFO L87 Difference]: Start difference. First operand 249 states and 305 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 21:11:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:27,991 INFO L93 Difference]: Finished difference Result 658 states and 871 transitions. [2022-11-02 21:11:27,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:11:27,991 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-11-02 21:11:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:27,993 INFO L225 Difference]: With dead ends: 658 [2022-11-02 21:11:27,994 INFO L226 Difference]: Without dead ends: 541 [2022-11-02 21:11:27,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:11:27,995 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 1954 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:27,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 1318 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:11:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-11-02 21:11:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 186. [2022-11-02 21:11:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.2596685082872927) internal successors, (228), 185 states have internal predecessors, (228), 0 states have call successors, (0), 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 21:11:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 228 transitions. [2022-11-02 21:11:28,066 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 228 transitions. Word has length 65 [2022-11-02 21:11:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:28,067 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 228 transitions. [2022-11-02 21:11:28,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 21:11:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 228 transitions. [2022-11-02 21:11:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 21:11:28,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:28,068 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] [2022-11-02 21:11:28,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:11:28,068 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1910519334, now seen corresponding path program 1 times [2022-11-02 21:11:28,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:28,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646671578] [2022-11-02 21:11:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:28,292 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 21:11:28,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:28,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646671578] [2022-11-02 21:11:28,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646671578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:28,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:28,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:28,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186057494] [2022-11-02 21:11:28,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:28,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:28,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:28,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:28,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:28,296 INFO L87 Difference]: Start difference. First operand 186 states and 228 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 21:11:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:28,796 INFO L93 Difference]: Finished difference Result 286 states and 356 transitions. [2022-11-02 21:11:28,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:11:28,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-11-02 21:11:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:28,798 INFO L225 Difference]: With dead ends: 286 [2022-11-02 21:11:28,798 INFO L226 Difference]: Without dead ends: 279 [2022-11-02 21:11:28,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:11:28,799 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 547 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:28,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 514 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:11:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-02 21:11:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2022-11-02 21:11:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.2486187845303867) internal successors, (226), 185 states have internal predecessors, (226), 0 states have call successors, (0), 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 21:11:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 226 transitions. [2022-11-02 21:11:28,861 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 226 transitions. Word has length 66 [2022-11-02 21:11:28,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:28,861 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 226 transitions. [2022-11-02 21:11:28,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 21:11:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 226 transitions. [2022-11-02 21:11:28,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 21:11:28,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:28,863 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] [2022-11-02 21:11:28,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:11:28,863 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:28,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash -679485959, now seen corresponding path program 1 times [2022-11-02 21:11:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:28,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391046156] [2022-11-02 21:11:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:29,745 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 21:11:29,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:29,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391046156] [2022-11-02 21:11:29,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391046156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:29,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:29,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 21:11:29,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585373727] [2022-11-02 21:11:29,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:29,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:11:29,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:29,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:11:29,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:11:29,747 INFO L87 Difference]: Start difference. First operand 186 states and 226 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 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 21:11:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:31,725 INFO L93 Difference]: Finished difference Result 500 states and 647 transitions. [2022-11-02 21:11:31,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 21:11:31,726 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-11-02 21:11:31,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:31,728 INFO L225 Difference]: With dead ends: 500 [2022-11-02 21:11:31,728 INFO L226 Difference]: Without dead ends: 496 [2022-11-02 21:11:31,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 21:11:31,729 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 1279 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 2813 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:31,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 2813 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 21:11:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-11-02 21:11:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 191. [2022-11-02 21:11:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.2473118279569892) internal successors, (232), 190 states have internal predecessors, (232), 0 states have call successors, (0), 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 21:11:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2022-11-02 21:11:31,809 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 66 [2022-11-02 21:11:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:31,809 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2022-11-02 21:11:31,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 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 21:11:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2022-11-02 21:11:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 21:11:31,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:31,810 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] [2022-11-02 21:11:31,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:11:31,810 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:31,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash -595757799, now seen corresponding path program 1 times [2022-11-02 21:11:31,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:31,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405387316] [2022-11-02 21:11:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:32,330 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 21:11:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:32,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405387316] [2022-11-02 21:11:32,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405387316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:32,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:32,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 21:11:32,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986533755] [2022-11-02 21:11:32,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:32,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:11:32,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:32,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:11:32,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:11:32,332 INFO L87 Difference]: Start difference. First operand 191 states and 232 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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 21:11:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:33,280 INFO L93 Difference]: Finished difference Result 482 states and 639 transitions. [2022-11-02 21:11:33,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:11:33,281 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-11-02 21:11:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:33,282 INFO L225 Difference]: With dead ends: 482 [2022-11-02 21:11:33,283 INFO L226 Difference]: Without dead ends: 376 [2022-11-02 21:11:33,283 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 21:11:33,284 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 848 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:33,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 2099 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:11:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-02 21:11:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 133. [2022-11-02 21:11:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 132 states have internal predecessors, (165), 0 states have call successors, (0), 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 21:11:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 165 transitions. [2022-11-02 21:11:33,353 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 165 transitions. Word has length 66 [2022-11-02 21:11:33,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:33,353 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 165 transitions. [2022-11-02 21:11:33,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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 21:11:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2022-11-02 21:11:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 21:11:33,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:33,355 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] [2022-11-02 21:11:33,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:11:33,355 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:33,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 476193166, now seen corresponding path program 1 times [2022-11-02 21:11:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:33,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919711094] [2022-11-02 21:11:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:33,563 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 21:11:33,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:33,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919711094] [2022-11-02 21:11:33,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919711094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:33,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:33,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558426064] [2022-11-02 21:11:33,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:33,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:33,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:33,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:33,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:33,566 INFO L87 Difference]: Start difference. First operand 133 states and 165 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 21:11:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:34,095 INFO L93 Difference]: Finished difference Result 286 states and 376 transitions. [2022-11-02 21:11:34,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:11:34,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-11-02 21:11:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:34,097 INFO L225 Difference]: With dead ends: 286 [2022-11-02 21:11:34,097 INFO L226 Difference]: Without dead ends: 214 [2022-11-02 21:11:34,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-11-02 21:11:34,099 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 597 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:34,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 527 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:11:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-02 21:11:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2022-11-02 21:11:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 131 states have (on average 1.251908396946565) internal successors, (164), 132 states have internal predecessors, (164), 0 states have call successors, (0), 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 21:11:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2022-11-02 21:11:34,167 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 66 [2022-11-02 21:11:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:34,168 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2022-11-02 21:11:34,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 21:11:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2022-11-02 21:11:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 21:11:34,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:34,169 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] [2022-11-02 21:11:34,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:11:34,169 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:34,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:34,170 INFO L85 PathProgramCache]: Analyzing trace with hash 989039241, now seen corresponding path program 1 times [2022-11-02 21:11:34,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:34,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44660738] [2022-11-02 21:11:34,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:34,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:35,421 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 21:11:35,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:35,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44660738] [2022-11-02 21:11:35,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44660738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:35,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:35,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-02 21:11:35,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290259944] [2022-11-02 21:11:35,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:35,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 21:11:35,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:35,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 21:11:35,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:11:35,423 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 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 21:11:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:39,442 INFO L93 Difference]: Finished difference Result 688 states and 939 transitions. [2022-11-02 21:11:39,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 21:11:39,446 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-11-02 21:11:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:39,449 INFO L225 Difference]: With dead ends: 688 [2022-11-02 21:11:39,449 INFO L226 Difference]: Without dead ends: 682 [2022-11-02 21:11:39,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=265, Invalid=1375, Unknown=0, NotChecked=0, Total=1640 [2022-11-02 21:11:39,450 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 1685 mSDsluCounter, 5832 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 6283 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:39,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 6283 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 21:11:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-11-02 21:11:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 149. [2022-11-02 21:11:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 1.251700680272109) internal successors, (184), 148 states have internal predecessors, (184), 0 states have call successors, (0), 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 21:11:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 184 transitions. [2022-11-02 21:11:39,524 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 184 transitions. Word has length 68 [2022-11-02 21:11:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:39,524 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 184 transitions. [2022-11-02 21:11:39,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 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 21:11:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 184 transitions. [2022-11-02 21:11:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 21:11:39,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:39,525 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] [2022-11-02 21:11:39,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:11:39,526 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:39,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash 882869858, now seen corresponding path program 1 times [2022-11-02 21:11:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:39,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269959107] [2022-11-02 21:11:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:40,273 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 21:11:40,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:40,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269959107] [2022-11-02 21:11:40,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269959107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:40,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:40,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 21:11:40,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707725357] [2022-11-02 21:11:40,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:40,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:11:40,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:40,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:11:40,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:11:40,275 INFO L87 Difference]: Start difference. First operand 149 states and 184 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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 21:11:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:42,385 INFO L93 Difference]: Finished difference Result 607 states and 846 transitions. [2022-11-02 21:11:42,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 21:11:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-11-02 21:11:42,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:42,387 INFO L225 Difference]: With dead ends: 607 [2022-11-02 21:11:42,387 INFO L226 Difference]: Without dead ends: 601 [2022-11-02 21:11:42,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2022-11-02 21:11:42,389 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 1286 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 3281 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:42,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 3281 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 21:11:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-11-02 21:11:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 139. [2022-11-02 21:11:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 138 states have internal predecessors, (172), 0 states have call successors, (0), 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 21:11:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 172 transitions. [2022-11-02 21:11:42,451 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 172 transitions. Word has length 69 [2022-11-02 21:11:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:42,452 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 172 transitions. [2022-11-02 21:11:42,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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 21:11:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2022-11-02 21:11:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 21:11:42,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:42,453 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] [2022-11-02 21:11:42,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:11:42,453 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1637741865, now seen corresponding path program 1 times [2022-11-02 21:11:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:42,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56442938] [2022-11-02 21:11:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:43,038 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 21:11:43,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:43,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56442938] [2022-11-02 21:11:43,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56442938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:43,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:43,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 21:11:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196754530] [2022-11-02 21:11:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:43,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 21:11:43,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:43,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:11:43,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:11:43,040 INFO L87 Difference]: Start difference. First operand 139 states and 172 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 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 21:11:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:44,677 INFO L93 Difference]: Finished difference Result 550 states and 765 transitions. [2022-11-02 21:11:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 21:11:44,678 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-11-02 21:11:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:44,680 INFO L225 Difference]: With dead ends: 550 [2022-11-02 21:11:44,681 INFO L226 Difference]: Without dead ends: 544 [2022-11-02 21:11:44,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-11-02 21:11:44,682 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 1206 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:44,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 2610 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:11:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-11-02 21:11:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 127. [2022-11-02 21:11:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.253968253968254) internal successors, (158), 126 states have internal predecessors, (158), 0 states have call successors, (0), 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 21:11:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2022-11-02 21:11:44,775 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 69 [2022-11-02 21:11:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:44,775 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2022-11-02 21:11:44,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 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 21:11:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2022-11-02 21:11:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 21:11:44,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:44,777 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] [2022-11-02 21:11:44,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:11:44,777 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:44,778 INFO L85 PathProgramCache]: Analyzing trace with hash 262304865, now seen corresponding path program 1 times [2022-11-02 21:11:44,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:44,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293565516] [2022-11-02 21:11:44,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:44,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:44,889 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 21:11:44,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:44,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293565516] [2022-11-02 21:11:44,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293565516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:44,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:44,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:11:44,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951991905] [2022-11-02 21:11:44,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:44,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:11:44,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:44,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:11:44,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:11:44,892 INFO L87 Difference]: Start difference. First operand 127 states and 158 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 21:11:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:45,527 INFO L93 Difference]: Finished difference Result 559 states and 798 transitions. [2022-11-02 21:11:45,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:11:45,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-11-02 21:11:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:45,528 INFO L225 Difference]: With dead ends: 559 [2022-11-02 21:11:45,528 INFO L226 Difference]: Without dead ends: 505 [2022-11-02 21:11:45,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:11:45,529 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 892 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:45,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 949 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:11:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-11-02 21:11:45,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 179. [2022-11-02 21:11:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.3202247191011236) internal successors, (235), 178 states have internal predecessors, (235), 0 states have call successors, (0), 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 21:11:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 235 transitions. [2022-11-02 21:11:45,662 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 235 transitions. Word has length 91 [2022-11-02 21:11:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:45,662 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 235 transitions. [2022-11-02 21:11:45,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 21:11:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2022-11-02 21:11:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 21:11:45,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:45,664 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] [2022-11-02 21:11:45,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 21:11:45,664 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:45,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash -403802728, now seen corresponding path program 1 times [2022-11-02 21:11:45,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:45,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753658044] [2022-11-02 21:11:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:45,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:45,787 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 21:11:45,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:45,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753658044] [2022-11-02 21:11:45,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753658044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:45,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:45,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:11:45,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27290540] [2022-11-02 21:11:45,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:45,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:11:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:11:45,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:11:45,789 INFO L87 Difference]: Start difference. First operand 179 states and 235 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 21:11:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:46,341 INFO L93 Difference]: Finished difference Result 657 states and 941 transitions. [2022-11-02 21:11:46,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:11:46,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-11-02 21:11:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:46,345 INFO L225 Difference]: With dead ends: 657 [2022-11-02 21:11:46,345 INFO L226 Difference]: Without dead ends: 551 [2022-11-02 21:11:46,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:46,346 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 645 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:46,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 671 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:11:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-11-02 21:11:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 283. [2022-11-02 21:11:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.3829787234042554) internal successors, (390), 282 states have internal predecessors, (390), 0 states have call successors, (0), 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 21:11:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 390 transitions. [2022-11-02 21:11:46,556 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 390 transitions. Word has length 93 [2022-11-02 21:11:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:46,556 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 390 transitions. [2022-11-02 21:11:46,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 21:11:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 390 transitions. [2022-11-02 21:11:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 21:11:46,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:46,558 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] [2022-11-02 21:11:46,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 21:11:46,558 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:46,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:46,559 INFO L85 PathProgramCache]: Analyzing trace with hash 638646745, now seen corresponding path program 1 times [2022-11-02 21:11:46,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:46,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054498326] [2022-11-02 21:11:46,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:46,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:46,758 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 21:11:46,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:46,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054498326] [2022-11-02 21:11:46,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054498326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:46,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:46,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:11:46,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049376260] [2022-11-02 21:11:46,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:46,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:11:46,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:46,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:11:46,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:11:46,761 INFO L87 Difference]: Start difference. First operand 283 states and 390 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 21:11:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:47,058 INFO L93 Difference]: Finished difference Result 495 states and 703 transitions. [2022-11-02 21:11:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:11:47,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-11-02 21:11:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:47,061 INFO L225 Difference]: With dead ends: 495 [2022-11-02 21:11:47,061 INFO L226 Difference]: Without dead ends: 285 [2022-11-02 21:11:47,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:11:47,063 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 480 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:47,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 376 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:11:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-02 21:11:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2022-11-02 21:11:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.375886524822695) internal successors, (388), 282 states have internal predecessors, (388), 0 states have call successors, (0), 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 21:11:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 388 transitions. [2022-11-02 21:11:47,278 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 388 transitions. Word has length 93 [2022-11-02 21:11:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:47,279 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 388 transitions. [2022-11-02 21:11:47,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 21:11:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 388 transitions. [2022-11-02 21:11:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 21:11:47,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:47,280 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] [2022-11-02 21:11:47,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 21:11:47,281 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:47,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:47,281 INFO L85 PathProgramCache]: Analyzing trace with hash 572153233, now seen corresponding path program 1 times [2022-11-02 21:11:47,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:47,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201994254] [2022-11-02 21:11:47,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:47,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:47,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 21:11:47,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:47,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201994254] [2022-11-02 21:11:47,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201994254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:47,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:47,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:11:47,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628789393] [2022-11-02 21:11:47,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:47,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:11:47,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:47,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:47,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:47,336 INFO L87 Difference]: Start difference. First operand 283 states and 388 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 21:11:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:47,757 INFO L93 Difference]: Finished difference Result 677 states and 964 transitions. [2022-11-02 21:11:47,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:47,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-11-02 21:11:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:47,758 INFO L225 Difference]: With dead ends: 677 [2022-11-02 21:11:47,758 INFO L226 Difference]: Without dead ends: 467 [2022-11-02 21:11:47,759 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 21:11:47,760 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 88 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 250 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 21:11:47,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 250 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:11:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-11-02 21:11:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 461. [2022-11-02 21:11:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.3891304347826088) internal successors, (639), 460 states have internal predecessors, (639), 0 states have call successors, (0), 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 21:11:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 639 transitions. [2022-11-02 21:11:48,121 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 639 transitions. Word has length 93 [2022-11-02 21:11:48,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:48,122 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 639 transitions. [2022-11-02 21:11:48,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 21:11:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 639 transitions. [2022-11-02 21:11:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 21:11:48,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:48,123 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] [2022-11-02 21:11:48,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 21:11:48,124 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:48,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1651929496, now seen corresponding path program 1 times [2022-11-02 21:11:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:48,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601731401] [2022-11-02 21:11:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:48,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:48,238 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 21:11:48,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:48,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601731401] [2022-11-02 21:11:48,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601731401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:48,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:48,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:11:48,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568956431] [2022-11-02 21:11:48,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:48,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:11:48,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:48,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:11:48,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:11:48,241 INFO L87 Difference]: Start difference. First operand 461 states and 639 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 21:11:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:49,425 INFO L93 Difference]: Finished difference Result 1340 states and 1907 transitions. [2022-11-02 21:11:49,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:11:49,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-11-02 21:11:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:49,430 INFO L225 Difference]: With dead ends: 1340 [2022-11-02 21:11:49,430 INFO L226 Difference]: Without dead ends: 1145 [2022-11-02 21:11:49,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:49,432 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 611 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:49,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 688 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:11:49,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-11-02 21:11:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 751. [2022-11-02 21:11:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.4093333333333333) internal successors, (1057), 750 states have internal predecessors, (1057), 0 states have call successors, (0), 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 21:11:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1057 transitions. [2022-11-02 21:11:50,138 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1057 transitions. Word has length 93 [2022-11-02 21:11:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:50,139 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1057 transitions. [2022-11-02 21:11:50,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 21:11:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1057 transitions. [2022-11-02 21:11:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 21:11:50,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:50,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 21:11:50,140 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash -767888488, now seen corresponding path program 1 times [2022-11-02 21:11:50,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:50,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926371340] [2022-11-02 21:11:50,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:50,255 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 21:11:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:50,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926371340] [2022-11-02 21:11:50,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926371340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:50,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:50,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:11:50,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268893309] [2022-11-02 21:11:50,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:50,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:11:50,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:50,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:11:50,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:11:50,257 INFO L87 Difference]: Start difference. First operand 751 states and 1057 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 21:11:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:51,535 INFO L93 Difference]: Finished difference Result 1533 states and 2186 transitions. [2022-11-02 21:11:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:11:51,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-11-02 21:11:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:51,538 INFO L225 Difference]: With dead ends: 1533 [2022-11-02 21:11:51,538 INFO L226 Difference]: Without dead ends: 1338 [2022-11-02 21:11:51,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:51,539 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 580 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:51,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 739 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:11:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-11-02 21:11:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 944. [2022-11-02 21:11:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 943 states have (on average 1.4167550371155886) internal successors, (1336), 943 states have internal predecessors, (1336), 0 states have call successors, (0), 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 21:11:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1336 transitions. [2022-11-02 21:11:52,640 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1336 transitions. Word has length 93 [2022-11-02 21:11:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:52,640 INFO L495 AbstractCegarLoop]: Abstraction has 944 states and 1336 transitions. [2022-11-02 21:11:52,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 21:11:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1336 transitions. [2022-11-02 21:11:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 21:11:52,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:52,642 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] [2022-11-02 21:11:52,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 21:11:52,642 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:52,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2122104904, now seen corresponding path program 1 times [2022-11-02 21:11:52,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:52,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129325794] [2022-11-02 21:11:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:52,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:52,751 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 21:11:52,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:52,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129325794] [2022-11-02 21:11:52,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129325794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:52,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:52,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:11:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363447586] [2022-11-02 21:11:52,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:52,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:11:52,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:52,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:52,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:52,753 INFO L87 Difference]: Start difference. First operand 944 states and 1336 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 21:11:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:54,531 INFO L93 Difference]: Finished difference Result 2614 states and 3726 transitions. [2022-11-02 21:11:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:54,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2022-11-02 21:11:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:54,535 INFO L225 Difference]: With dead ends: 2614 [2022-11-02 21:11:54,535 INFO L226 Difference]: Without dead ends: 1743 [2022-11-02 21:11:54,536 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 21:11:54,536 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 72 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 331 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 21:11:54,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 331 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:11:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2022-11-02 21:11:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1669. [2022-11-02 21:11:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.4142685851318946) internal successors, (2359), 1668 states have internal predecessors, (2359), 0 states have call successors, (0), 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 21:11:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2359 transitions. [2022-11-02 21:11:56,023 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2359 transitions. Word has length 94 [2022-11-02 21:11:56,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:56,024 INFO L495 AbstractCegarLoop]: Abstraction has 1669 states and 2359 transitions. [2022-11-02 21:11:56,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 21:11:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2359 transitions. [2022-11-02 21:11:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 21:11:56,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:56,026 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] [2022-11-02 21:11:56,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 21:11:56,026 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:11:56,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1022881993, now seen corresponding path program 1 times [2022-11-02 21:11:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:56,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937348344] [2022-11-02 21:11:56,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:56,162 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 21:11:56,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:56,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937348344] [2022-11-02 21:11:56,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937348344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:56,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:56,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:11:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724250120] [2022-11-02 21:11:56,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:56,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:11:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:56,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:56,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:56,164 INFO L87 Difference]: Start difference. First operand 1669 states and 2359 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 21:11:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:59,535 INFO L93 Difference]: Finished difference Result 4717 states and 6669 transitions. [2022-11-02 21:11:59,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:59,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-11-02 21:11:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:59,542 INFO L225 Difference]: With dead ends: 4717 [2022-11-02 21:11:59,542 INFO L226 Difference]: Without dead ends: 3121 [2022-11-02 21:11:59,544 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 21:11:59,545 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 65 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 331 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 21:11:59,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 331 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:11:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2022-11-02 21:12:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 2975. [2022-11-02 21:12:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2974 states have (on average 1.402488231338265) internal successors, (4171), 2974 states have internal predecessors, (4171), 0 states have call successors, (0), 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 21:12:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4171 transitions. [2022-11-02 21:12:02,254 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4171 transitions. Word has length 95 [2022-11-02 21:12:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:02,254 INFO L495 AbstractCegarLoop]: Abstraction has 2975 states and 4171 transitions. [2022-11-02 21:12:02,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 21:12:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4171 transitions. [2022-11-02 21:12:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-02 21:12:02,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:02,255 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] [2022-11-02 21:12:02,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 21:12:02,256 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:12:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash -369091068, now seen corresponding path program 1 times [2022-11-02 21:12:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:02,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100734032] [2022-11-02 21:12:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:02,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:02,390 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 21:12:02,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:02,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100734032] [2022-11-02 21:12:02,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100734032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:02,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:02,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:12:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206382553] [2022-11-02 21:12:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:02,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:12:02,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:02,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:12:02,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:12:02,393 INFO L87 Difference]: Start difference. First operand 2975 states and 4171 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 21:12:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:07,909 INFO L93 Difference]: Finished difference Result 8491 states and 11853 transitions. [2022-11-02 21:12:07,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:12:07,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-11-02 21:12:07,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:07,927 INFO L225 Difference]: With dead ends: 8491 [2022-11-02 21:12:07,927 INFO L226 Difference]: Without dead ends: 5589 [2022-11-02 21:12:07,931 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 21:12:07,931 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 55 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:07,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 331 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:12:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2022-11-02 21:12:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 5299. [2022-11-02 21:12:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5298 states have (on average 1.3829747074367686) internal successors, (7327), 5298 states have internal predecessors, (7327), 0 states have call successors, (0), 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 21:12:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7327 transitions. [2022-11-02 21:12:13,097 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7327 transitions. Word has length 96 [2022-11-02 21:12:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:13,097 INFO L495 AbstractCegarLoop]: Abstraction has 5299 states and 7327 transitions. [2022-11-02 21:12:13,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 21:12:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7327 transitions. [2022-11-02 21:12:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-02 21:12:13,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:13,098 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] [2022-11-02 21:12:13,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 21:12:13,099 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:12:13,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash -553088427, now seen corresponding path program 1 times [2022-11-02 21:12:13,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:13,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892650094] [2022-11-02 21:12:13,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:13,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:13,313 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 21:12:13,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:13,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892650094] [2022-11-02 21:12:13,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892650094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:13,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:13,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:12:13,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158478386] [2022-11-02 21:12:13,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:13,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:12:13,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:13,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:12:13,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:12:13,315 INFO L87 Difference]: Start difference. First operand 5299 states and 7327 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 21:12:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:22,803 INFO L93 Difference]: Finished difference Result 9355 states and 12847 transitions. [2022-11-02 21:12:22,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:12:22,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-11-02 21:12:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:22,822 INFO L225 Difference]: With dead ends: 9355 [2022-11-02 21:12:22,822 INFO L226 Difference]: Without dead ends: 9353 [2022-11-02 21:12:22,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:12:22,825 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 256 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:22,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 836 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:12:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9353 states. [2022-11-02 21:12:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9353 to 5491. [2022-11-02 21:12:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5491 states, 5490 states have (on average 1.362295081967213) internal successors, (7479), 5490 states have internal predecessors, (7479), 0 states have call successors, (0), 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 21:12:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5491 states to 5491 states and 7479 transitions. [2022-11-02 21:12:28,856 INFO L78 Accepts]: Start accepts. Automaton has 5491 states and 7479 transitions. Word has length 97 [2022-11-02 21:12:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:28,857 INFO L495 AbstractCegarLoop]: Abstraction has 5491 states and 7479 transitions. [2022-11-02 21:12:28,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 21:12:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 5491 states and 7479 transitions. [2022-11-02 21:12:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-02 21:12:28,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:28,858 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] [2022-11-02 21:12:28,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 21:12:28,860 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:12:28,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:28,861 INFO L85 PathProgramCache]: Analyzing trace with hash -404836723, now seen corresponding path program 1 times [2022-11-02 21:12:28,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:28,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679424194] [2022-11-02 21:12:28,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:29,013 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 21:12:29,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:29,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679424194] [2022-11-02 21:12:29,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679424194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:29,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:29,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:12:29,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974378814] [2022-11-02 21:12:29,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:29,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:12:29,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:29,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:12:29,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:12:29,016 INFO L87 Difference]: Start difference. First operand 5491 states and 7479 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 21:12:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:40,402 INFO L93 Difference]: Finished difference Result 10333 states and 14140 transitions. [2022-11-02 21:12:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:12:40,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-11-02 21:12:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:40,421 INFO L225 Difference]: With dead ends: 10333 [2022-11-02 21:12:40,421 INFO L226 Difference]: Without dead ends: 9123 [2022-11-02 21:12:40,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:12:40,425 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 638 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:40,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 750 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:12:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9123 states. [2022-11-02 21:12:47,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9123 to 6699. [2022-11-02 21:12:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6699 states, 6698 states have (on average 1.3626455658405494) internal successors, (9127), 6698 states have internal predecessors, (9127), 0 states have call successors, (0), 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 21:12:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6699 states to 6699 states and 9127 transitions. [2022-11-02 21:12:47,852 INFO L78 Accepts]: Start accepts. Automaton has 6699 states and 9127 transitions. Word has length 97 [2022-11-02 21:12:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:47,853 INFO L495 AbstractCegarLoop]: Abstraction has 6699 states and 9127 transitions. [2022-11-02 21:12:47,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 21:12:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 6699 states and 9127 transitions. [2022-11-02 21:12:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 21:12:47,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:47,854 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] [2022-11-02 21:12:47,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 21:12:47,855 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:12:47,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:47,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1477016020, now seen corresponding path program 1 times [2022-11-02 21:12:47,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:47,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647123391] [2022-11-02 21:12:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:47,957 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 21:12:47,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:47,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647123391] [2022-11-02 21:12:47,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647123391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:47,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:47,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:12:47,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482926310] [2022-11-02 21:12:47,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:47,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:12:47,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:47,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:12:47,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:12:47,959 INFO L87 Difference]: Start difference. First operand 6699 states and 9127 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 21:13:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:00,140 INFO L93 Difference]: Finished difference Result 17399 states and 23653 transitions. [2022-11-02 21:13:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:13:00,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-11-02 21:13:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:00,164 INFO L225 Difference]: With dead ends: 17399 [2022-11-02 21:13:00,164 INFO L226 Difference]: Without dead ends: 10773 [2022-11-02 21:13:00,170 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 21:13:00,171 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 76 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 334 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 21:13:00,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 334 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:13:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10773 states. [2022-11-02 21:13:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10773 to 10067. [2022-11-02 21:13:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10067 states, 10066 states have (on average 1.3458176038148222) internal successors, (13547), 10066 states have internal predecessors, (13547), 0 states have call successors, (0), 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 21:13:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10067 states to 10067 states and 13547 transitions. [2022-11-02 21:13:12,095 INFO L78 Accepts]: Start accepts. Automaton has 10067 states and 13547 transitions. Word has length 98 [2022-11-02 21:13:12,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:12,095 INFO L495 AbstractCegarLoop]: Abstraction has 10067 states and 13547 transitions. [2022-11-02 21:13:12,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 21:13:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 10067 states and 13547 transitions. [2022-11-02 21:13:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-02 21:13:12,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:12,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:13:12,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 21:13:12,099 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:13:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash -659580428, now seen corresponding path program 1 times [2022-11-02 21:13:12,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:12,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825793875] [2022-11-02 21:13:12,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:13:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:12,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825793875] [2022-11-02 21:13:12,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825793875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:12,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:12,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:13:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682213367] [2022-11-02 21:13:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:12,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:13:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:12,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:13:12,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:13:12,202 INFO L87 Difference]: Start difference. First operand 10067 states and 13547 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 21:13:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:23,148 INFO L93 Difference]: Finished difference Result 20063 states and 27017 transitions. [2022-11-02 21:13:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:13:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2022-11-02 21:13:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:23,166 INFO L225 Difference]: With dead ends: 20063 [2022-11-02 21:13:23,166 INFO L226 Difference]: Without dead ends: 10069 [2022-11-02 21:13:23,175 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 21:13:23,176 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 68 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:23,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 308 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:13:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10069 states. [2022-11-02 21:13:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10069 to 10067. [2022-11-02 21:13:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10067 states, 10066 states have (on average 1.3283330021855753) internal successors, (13371), 10066 states have internal predecessors, (13371), 0 states have call successors, (0), 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 21:13:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10067 states to 10067 states and 13371 transitions. [2022-11-02 21:13:34,081 INFO L78 Accepts]: Start accepts. Automaton has 10067 states and 13371 transitions. Word has length 124 [2022-11-02 21:13:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:34,081 INFO L495 AbstractCegarLoop]: Abstraction has 10067 states and 13371 transitions. [2022-11-02 21:13:34,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 21:13:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 10067 states and 13371 transitions. [2022-11-02 21:13:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-02 21:13:34,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:34,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:13:34,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 21:13:34,084 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 21:13:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:34,085 INFO L85 PathProgramCache]: Analyzing trace with hash -448021413, now seen corresponding path program 1 times [2022-11-02 21:13:34,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:34,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179524241] [2022-11-02 21:13:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:34,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:13:34,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:34,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179524241] [2022-11-02 21:13:34,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179524241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:13:34,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370996097] [2022-11-02 21:13:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:34,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:13:34,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:13:34,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:13:34,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_834da18d-e559-4e4e-ac5e-773abb8b154d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:13:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:34,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 21:13:34,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:13:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:13:35,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:13:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:13:37,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370996097] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:13:37,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:13:37,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-11-02 21:13:37,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296102714] [2022-11-02 21:13:37,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:13:37,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 21:13:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 21:13:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2022-11-02 21:13:37,109 INFO L87 Difference]: Start difference. First operand 10067 states and 13371 transitions. Second operand has 27 states, 27 states have (on average 10.851851851851851) internal successors, (293), 26 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)