./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/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_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/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_a2f9401f-88ab-43a6-bb69-f9c46304decf/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 a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:54:43,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:54:43,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:54:43,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:54:43,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:54:43,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:54:43,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:54:43,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:54:43,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:54:43,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:54:43,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:54:43,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:54:43,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:54:43,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:54:43,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:54:43,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:54:43,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:54:43,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:54:43,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:54:43,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:54:43,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:54:43,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:54:43,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:54:43,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:54:43,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:54:43,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:54:43,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:54:43,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:54:43,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:54:43,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:54:43,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:54:43,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:54:43,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:54:43,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:54:43,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:54:43,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:54:43,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:54:43,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:54:43,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:54:43,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:54:43,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:54:43,625 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:54:43,663 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:54:43,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:54:43,664 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:54:43,665 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:54:43,665 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:54:43,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:54:43,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:54:43,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:54:43,667 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:54:43,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:54:43,668 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:54:43,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:54:43,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:54:43,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:54:43,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:54:43,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:54:43,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:54:43,669 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:54:43,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:54:43,670 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:54:43,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:54:43,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:54:43,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:54:43,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:54:43,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:43,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:54:43,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:54:43,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:54:43,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:54:43,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:54:43,672 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:54:43,672 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:54:43,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:54:43,673 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/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_a2f9401f-88ab-43a6-bb69-f9c46304decf/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 -> a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b [2022-11-02 20:54:43,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:54:43,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:54:43,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:54:43,974 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:54:43,975 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:54:43,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-11-02 20:54:44,041 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/data/edf524fea/b7aa7f061dd74aac8cee493849b68d4d/FLAGcc39822a5 [2022-11-02 20:54:44,616 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:54:44,616 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-11-02 20:54:44,631 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/data/edf524fea/b7aa7f061dd74aac8cee493849b68d4d/FLAGcc39822a5 [2022-11-02 20:54:44,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/data/edf524fea/b7aa7f061dd74aac8cee493849b68d4d [2022-11-02 20:54:44,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:54:44,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:54:44,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:44,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:54:44,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:54:44,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:44" (1/1) ... [2022-11-02 20:54:44,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6000d763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:44, skipping insertion in model container [2022-11-02 20:54:44,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:44" (1/1) ... [2022-11-02 20:54:44,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:54:45,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:54:45,344 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2022-11-02 20:54:45,366 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2022-11-02 20:54:45,375 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2022-11-02 20:54:45,382 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2022-11-02 20:54:45,392 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2022-11-02 20:54:45,398 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2022-11-02 20:54:45,406 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2022-11-02 20:54:45,423 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2022-11-02 20:54:45,429 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2022-11-02 20:54:45,436 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2022-11-02 20:54:45,448 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2022-11-02 20:54:45,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:45,571 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:54:45,626 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2022-11-02 20:54:45,639 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2022-11-02 20:54:45,646 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2022-11-02 20:54:45,649 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2022-11-02 20:54:45,656 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2022-11-02 20:54:45,673 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2022-11-02 20:54:45,678 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2022-11-02 20:54:45,687 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2022-11-02 20:54:45,705 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2022-11-02 20:54:45,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2022-11-02 20:54:45,727 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_a2f9401f-88ab-43a6-bb69-f9c46304decf/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2022-11-02 20:54:45,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:45,849 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:54:45,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45 WrapperNode [2022-11-02 20:54:45,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:45,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:45,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:54:45,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:54:45,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (1/1) ... [2022-11-02 20:54:45,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (1/1) ... [2022-11-02 20:54:45,936 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1790 [2022-11-02 20:54:45,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:45,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:54:45,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:54:45,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:54:45,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (1/1) ... [2022-11-02 20:54:45,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (1/1) ... [2022-11-02 20:54:45,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (1/1) ... [2022-11-02 20:54:45,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (1/1) ... [2022-11-02 20:54:46,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (1/1) ... [2022-11-02 20:54:46,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (1/1) ... [2022-11-02 20:54:46,067 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (1/1) ... [2022-11-02 20:54:46,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (1/1) ... [2022-11-02 20:54:46,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:54:46,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:54:46,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:54:46,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:54:46,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (1/1) ... [2022-11-02 20:54:46,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:46,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:46,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:54:46,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:54:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:54:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:54:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:54:46,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:54:46,357 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:54:46,360 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:54:47,675 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:54:47,687 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:54:47,688 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:54:47,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:47 BoogieIcfgContainer [2022-11-02 20:54:47,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:54:47,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:54:47,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:54:47,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:54:47,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:54:44" (1/3) ... [2022-11-02 20:54:47,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b22f658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:47, skipping insertion in model container [2022-11-02 20:54:47,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:45" (2/3) ... [2022-11-02 20:54:47,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b22f658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:47, skipping insertion in model container [2022-11-02 20:54:47,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:47" (3/3) ... [2022-11-02 20:54:47,717 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-11-02 20:54:47,737 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:54:47,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-02 20:54:47,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:54:47,824 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;@502ee7e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:54:47,824 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-02 20:54:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:47,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:54:47,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:47,844 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] [2022-11-02 20:54:47,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:54:47,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:47,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1863160701, now seen corresponding path program 1 times [2022-11-02 20:54:47,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:47,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767770725] [2022-11-02 20:54:47,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:47,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:48,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:48,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767770725] [2022-11-02 20:54:48,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767770725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:48,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:48,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:48,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046171897] [2022-11-02 20:54:48,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:48,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:54:48,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:48,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:54:48,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:48,535 INFO L87 Difference]: Start difference. First operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 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.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:49,083 INFO L93 Difference]: Finished difference Result 703 states and 1189 transitions. [2022-11-02 20:54:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:54:49,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-11-02 20:54:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:49,114 INFO L225 Difference]: With dead ends: 703 [2022-11-02 20:54:49,115 INFO L226 Difference]: Without dead ends: 427 [2022-11-02 20:54:49,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:54:49,128 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 1864 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:49,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1864 Valid, 499 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:54:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-11-02 20:54:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 385. [2022-11-02 20:54:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 374 states have (on average 1.36096256684492) internal successors, (509), 384 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2022-11-02 20:54:49,272 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 58 [2022-11-02 20:54:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:49,272 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2022-11-02 20:54:49,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2022-11-02 20:54:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:54:49,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:49,282 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 20:54:49,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:54:49,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:54:49,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1094505509, now seen corresponding path program 1 times [2022-11-02 20:54:49,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:49,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964434146] [2022-11-02 20:54:49,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:49,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964434146] [2022-11-02 20:54:49,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964434146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:49,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:49,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531794708] [2022-11-02 20:54:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:49,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:54:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:49,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:54:49,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:49,516 INFO L87 Difference]: Start difference. First operand 385 states and 509 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 20:54:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:49,801 INFO L93 Difference]: Finished difference Result 680 states and 921 transitions. [2022-11-02 20:54:49,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:54:49,803 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 20:54:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:49,805 INFO L225 Difference]: With dead ends: 680 [2022-11-02 20:54:49,805 INFO L226 Difference]: Without dead ends: 365 [2022-11-02 20:54:49,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:54:49,807 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 936 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:49,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 211 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:54:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-02 20:54:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-11-02 20:54:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 354 states have (on average 1.3644067796610169) internal successors, (483), 364 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 483 transitions. [2022-11-02 20:54:49,850 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 483 transitions. Word has length 59 [2022-11-02 20:54:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:49,850 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 483 transitions. [2022-11-02 20:54:49,851 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 20:54:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 483 transitions. [2022-11-02 20:54:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:54:49,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:49,853 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 20:54:49,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:54:49,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:54:49,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash 568036411, now seen corresponding path program 1 times [2022-11-02 20:54:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:49,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883266733] [2022-11-02 20:54:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:49,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:49,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883266733] [2022-11-02 20:54:49,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883266733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:49,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:49,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:49,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342761075] [2022-11-02 20:54:49,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:49,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:54:49,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:49,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:54:49,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:49,999 INFO L87 Difference]: Start difference. First operand 365 states and 483 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 20:54:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:50,224 INFO L93 Difference]: Finished difference Result 660 states and 893 transitions. [2022-11-02 20:54:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:54:50,225 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 20:54:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:50,227 INFO L225 Difference]: With dead ends: 660 [2022-11-02 20:54:50,227 INFO L226 Difference]: Without dead ends: 346 [2022-11-02 20:54:50,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:54:50,231 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 908 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:50,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 200 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:54:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-11-02 20:54:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-11-02 20:54:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 335 states have (on average 1.373134328358209) internal successors, (460), 345 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 460 transitions. [2022-11-02 20:54:50,271 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 460 transitions. Word has length 60 [2022-11-02 20:54:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:50,273 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 460 transitions. [2022-11-02 20:54:50,273 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 20:54:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 460 transitions. [2022-11-02 20:54:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:54:50,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:50,276 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 20:54:50,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:54:50,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:54:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:50,279 INFO L85 PathProgramCache]: Analyzing trace with hash -715476529, now seen corresponding path program 1 times [2022-11-02 20:54:50,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:50,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556571260] [2022-11-02 20:54:50,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:50,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:50,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:50,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556571260] [2022-11-02 20:54:50,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556571260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:50,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:50,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161660919] [2022-11-02 20:54:50,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:50,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:54:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:50,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:54:50,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:50,438 INFO L87 Difference]: Start difference. First operand 346 states and 460 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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 20:54:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:50,671 INFO L93 Difference]: Finished difference Result 641 states and 868 transitions. [2022-11-02 20:54:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:54:50,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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 20:54:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:50,674 INFO L225 Difference]: With dead ends: 641 [2022-11-02 20:54:50,674 INFO L226 Difference]: Without dead ends: 338 [2022-11-02 20:54:50,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:54:50,675 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 861 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:50,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 196 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:54:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-02 20:54:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2022-11-02 20:54:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3730886850152906) internal successors, (449), 337 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 449 transitions. [2022-11-02 20:54:50,705 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 449 transitions. Word has length 61 [2022-11-02 20:54:50,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:50,706 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 449 transitions. [2022-11-02 20:54:50,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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 20:54:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2022-11-02 20:54:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:54:50,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:50,707 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] [2022-11-02 20:54:50,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:54:50,708 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:54:50,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash 207205371, now seen corresponding path program 1 times [2022-11-02 20:54:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:50,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119064226] [2022-11-02 20:54:50,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:51,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:51,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119064226] [2022-11-02 20:54:51,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119064226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:51,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:51,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:54:51,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028082135] [2022-11-02 20:54:51,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:51,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:54:51,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:51,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:54:51,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:54:51,048 INFO L87 Difference]: Start difference. First operand 338 states and 449 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:51,778 INFO L93 Difference]: Finished difference Result 779 states and 1074 transitions. [2022-11-02 20:54:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:54:51,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-11-02 20:54:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:51,784 INFO L225 Difference]: With dead ends: 779 [2022-11-02 20:54:51,785 INFO L226 Difference]: Without dead ends: 639 [2022-11-02 20:54:51,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:54:51,794 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 1561 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:51,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 875 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:54:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-11-02 20:54:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 338. [2022-11-02 20:54:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3700305810397553) internal successors, (448), 337 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 448 transitions. [2022-11-02 20:54:51,834 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 448 transitions. Word has length 62 [2022-11-02 20:54:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:51,836 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 448 transitions. [2022-11-02 20:54:51,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 448 transitions. [2022-11-02 20:54:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:54:51,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:51,837 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] [2022-11-02 20:54:51,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:54:51,838 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:54:51,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:51,839 INFO L85 PathProgramCache]: Analyzing trace with hash -201639857, now seen corresponding path program 1 times [2022-11-02 20:54:51,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:51,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009852237] [2022-11-02 20:54:51,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:51,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:52,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:52,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009852237] [2022-11-02 20:54:52,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009852237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:52,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:52,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:54:52,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761778071] [2022-11-02 20:54:52,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:52,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:54:52,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:52,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:54:52,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:54:52,239 INFO L87 Difference]: Start difference. First operand 338 states and 448 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:53,168 INFO L93 Difference]: Finished difference Result 883 states and 1236 transitions. [2022-11-02 20:54:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:54:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-11-02 20:54:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:53,174 INFO L225 Difference]: With dead ends: 883 [2022-11-02 20:54:53,174 INFO L226 Difference]: Without dead ends: 765 [2022-11-02 20:54:53,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:54:53,178 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 1856 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:53,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 1005 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:54:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-11-02 20:54:53,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 338. [2022-11-02 20:54:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 337 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 447 transitions. [2022-11-02 20:54:53,235 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 447 transitions. Word has length 62 [2022-11-02 20:54:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:53,235 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 447 transitions. [2022-11-02 20:54:53,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 447 transitions. [2022-11-02 20:54:53,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:54:53,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:53,237 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] [2022-11-02 20:54:53,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:54:53,237 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:54:53,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1938423665, now seen corresponding path program 1 times [2022-11-02 20:54:53,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:53,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554185337] [2022-11-02 20:54:53,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:53,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:53,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:53,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554185337] [2022-11-02 20:54:53,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554185337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:53,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:53,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:54:53,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932053906] [2022-11-02 20:54:53,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:53,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:54:53,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:53,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:54:53,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:54:53,617 INFO L87 Difference]: Start difference. First operand 338 states and 447 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:54,458 INFO L93 Difference]: Finished difference Result 801 states and 1103 transitions. [2022-11-02 20:54:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:54:54,459 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-11-02 20:54:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:54,463 INFO L225 Difference]: With dead ends: 801 [2022-11-02 20:54:54,463 INFO L226 Difference]: Without dead ends: 631 [2022-11-02 20:54:54,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:54:54,465 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 1698 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1698 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:54,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1698 Valid, 1098 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:54:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-11-02 20:54:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 338. [2022-11-02 20:54:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3608562691131498) internal successors, (445), 337 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 445 transitions. [2022-11-02 20:54:54,510 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 445 transitions. Word has length 62 [2022-11-02 20:54:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:54,512 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 445 transitions. [2022-11-02 20:54:54,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 445 transitions. [2022-11-02 20:54:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:54:54,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:54,513 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] [2022-11-02 20:54:54,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:54:54,513 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:54:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:54,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1233191565, now seen corresponding path program 1 times [2022-11-02 20:54:54,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:54,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085271342] [2022-11-02 20:54:54,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:54,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:54,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085271342] [2022-11-02 20:54:54,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085271342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:54,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:54,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:54:54,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49226164] [2022-11-02 20:54:54,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:54,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:54:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:54,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:54:54,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:54:54,942 INFO L87 Difference]: Start difference. First operand 338 states and 445 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:55,861 INFO L93 Difference]: Finished difference Result 742 states and 1020 transitions. [2022-11-02 20:54:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:54:55,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-11-02 20:54:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:55,865 INFO L225 Difference]: With dead ends: 742 [2022-11-02 20:54:55,865 INFO L226 Difference]: Without dead ends: 737 [2022-11-02 20:54:55,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:54:55,867 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1548 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:55,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 1148 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:54:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-11-02 20:54:55,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 338. [2022-11-02 20:54:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3547400611620795) internal successors, (443), 337 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 443 transitions. [2022-11-02 20:54:55,918 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 443 transitions. Word has length 62 [2022-11-02 20:54:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:55,918 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 443 transitions. [2022-11-02 20:54:55,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 443 transitions. [2022-11-02 20:54:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:54:55,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:55,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:55,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:54:55,920 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:54:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash 679005537, now seen corresponding path program 1 times [2022-11-02 20:54:55,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:55,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616341450] [2022-11-02 20:54:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:55,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:56,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:56,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616341450] [2022-11-02 20:54:56,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616341450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:56,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:56,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:54:56,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880339210] [2022-11-02 20:54:56,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:56,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:54:56,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:56,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:54:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:54:56,215 INFO L87 Difference]: Start difference. First operand 338 states and 443 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:56,769 INFO L93 Difference]: Finished difference Result 688 states and 910 transitions. [2022-11-02 20:54:56,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:54:56,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-11-02 20:54:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:56,772 INFO L225 Difference]: With dead ends: 688 [2022-11-02 20:54:56,772 INFO L226 Difference]: Without dead ends: 503 [2022-11-02 20:54:56,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:54:56,773 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 1618 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:56,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 632 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:54:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-11-02 20:54:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 338. [2022-11-02 20:54:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3516819571865444) internal successors, (442), 337 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2022-11-02 20:54:56,827 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 62 [2022-11-02 20:54:56,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:56,827 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2022-11-02 20:54:56,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2022-11-02 20:54:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:54:56,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:56,829 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] [2022-11-02 20:54:56,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:54:56,829 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:54:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2031197374, now seen corresponding path program 1 times [2022-11-02 20:54:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:56,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284816712] [2022-11-02 20:54:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:57,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:57,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284816712] [2022-11-02 20:54:57,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284816712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:57,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:57,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:54:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380376624] [2022-11-02 20:54:57,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:57,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:54:57,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:57,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:54:57,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:54:57,090 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:57,906 INFO L93 Difference]: Finished difference Result 856 states and 1186 transitions. [2022-11-02 20:54:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:54:57,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 20:54:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:57,910 INFO L225 Difference]: With dead ends: 856 [2022-11-02 20:54:57,910 INFO L226 Difference]: Without dead ends: 745 [2022-11-02 20:54:57,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:54:57,912 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 949 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:57,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 962 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:54:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-11-02 20:54:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 338. [2022-11-02 20:54:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.348623853211009) internal successors, (441), 337 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 441 transitions. [2022-11-02 20:54:57,995 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 441 transitions. Word has length 64 [2022-11-02 20:54:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:57,995 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 441 transitions. [2022-11-02 20:54:57,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 441 transitions. [2022-11-02 20:54:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:54:57,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:57,997 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] [2022-11-02 20:54:57,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:54:57,998 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 20:54:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:57,998 INFO L85 PathProgramCache]: Analyzing trace with hash -119000272, now seen corresponding path program 1 times [2022-11-02 20:54:57,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:57,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366879392] [2022-11-02 20:54:57,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:57,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:58,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:58,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366879392] [2022-11-02 20:54:58,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366879392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:58,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:58,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:54:58,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914226330] [2022-11-02 20:54:58,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:58,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:54:58,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:58,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:54:58,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:54:58,307 INFO L87 Difference]: Start difference. First operand 338 states and 441 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:59,277 INFO L93 Difference]: Finished difference Result 888 states and 1233 transitions. [2022-11-02 20:54:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:54:59,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 20:54:59,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:59,280 INFO L225 Difference]: With dead ends: 888 [2022-11-02 20:54:59,281 INFO L226 Difference]: Without dead ends: 765 [2022-11-02 20:54:59,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:54:59,282 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 1261 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:59,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 1251 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:54:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-11-02 20:54:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 338. [2022-11-02 20:54:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.345565749235474) internal successors, (440), 337 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 440 transitions. [2022-11-02 20:54:59,352 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 440 transitions. Word has length 64 [2022-11-02 20:54:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:59,352 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 440 transitions. [2022-11-02 20:54:59,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 440 transitions. [2022-11-02 20:54:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:54:59,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:59,354 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] [2022-11-02 20:54:59,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:54:59,354 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:54:59,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1520301075, now seen corresponding path program 1 times [2022-11-02 20:54:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:59,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200013442] [2022-11-02 20:54:59,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:59,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:59,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:59,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200013442] [2022-11-02 20:54:59,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200013442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:59,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:59,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:54:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108190631] [2022-11-02 20:54:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:59,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:54:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:54:59,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:54:59,614 INFO L87 Difference]: Start difference. First operand 338 states and 440 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:00,575 INFO L93 Difference]: Finished difference Result 853 states and 1181 transitions. [2022-11-02 20:55:00,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:55:00,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 20:55:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:00,579 INFO L225 Difference]: With dead ends: 853 [2022-11-02 20:55:00,579 INFO L226 Difference]: Without dead ends: 745 [2022-11-02 20:55:00,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:55:00,581 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 1201 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:00,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 1116 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:55:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-11-02 20:55:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 338. [2022-11-02 20:55:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.342507645259939) internal successors, (439), 337 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 439 transitions. [2022-11-02 20:55:00,646 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 439 transitions. Word has length 64 [2022-11-02 20:55:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:00,647 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 439 transitions. [2022-11-02 20:55:00,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 439 transitions. [2022-11-02 20:55:00,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:55:00,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:00,649 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] [2022-11-02 20:55:00,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:55:00,649 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:00,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1508633347, now seen corresponding path program 1 times [2022-11-02 20:55:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:00,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248146721] [2022-11-02 20:55:00,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:00,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:00,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:00,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248146721] [2022-11-02 20:55:00,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248146721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:00,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:00,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:55:00,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544637701] [2022-11-02 20:55:00,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:00,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:55:00,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:55:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:55:00,903 INFO L87 Difference]: Start difference. First operand 338 states and 439 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:01,915 INFO L93 Difference]: Finished difference Result 750 states and 1022 transitions. [2022-11-02 20:55:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:55:01,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 20:55:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:01,918 INFO L225 Difference]: With dead ends: 750 [2022-11-02 20:55:01,918 INFO L226 Difference]: Without dead ends: 745 [2022-11-02 20:55:01,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:55:01,920 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 785 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:01,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1252 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:55:01,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-11-02 20:55:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 338. [2022-11-02 20:55:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 337 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 438 transitions. [2022-11-02 20:55:01,990 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 438 transitions. Word has length 64 [2022-11-02 20:55:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:01,991 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 438 transitions. [2022-11-02 20:55:01,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 438 transitions. [2022-11-02 20:55:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:55:01,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:01,992 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] [2022-11-02 20:55:01,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:55:01,994 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:01,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1008042549, now seen corresponding path program 1 times [2022-11-02 20:55:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:01,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282224695] [2022-11-02 20:55:01,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:01,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:02,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:02,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282224695] [2022-11-02 20:55:02,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282224695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:02,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:02,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:55:02,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217477790] [2022-11-02 20:55:02,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:02,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:55:02,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:02,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:55:02,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:55:02,306 INFO L87 Difference]: Start difference. First operand 338 states and 438 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:03,394 INFO L93 Difference]: Finished difference Result 782 states and 1068 transitions. [2022-11-02 20:55:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:55:03,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 20:55:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:03,397 INFO L225 Difference]: With dead ends: 782 [2022-11-02 20:55:03,398 INFO L226 Difference]: Without dead ends: 765 [2022-11-02 20:55:03,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:55:03,399 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 1420 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:03,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 1308 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:55:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-11-02 20:55:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 338. [2022-11-02 20:55:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3333333333333333) internal successors, (436), 337 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 436 transitions. [2022-11-02 20:55:03,471 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 436 transitions. Word has length 64 [2022-11-02 20:55:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:03,471 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 436 transitions. [2022-11-02 20:55:03,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 436 transitions. [2022-11-02 20:55:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:55:03,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:03,472 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 20:55:03,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:55:03,473 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash 370944031, now seen corresponding path program 1 times [2022-11-02 20:55:03,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:03,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783214497] [2022-11-02 20:55:03,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:03,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:03,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:03,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783214497] [2022-11-02 20:55:03,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783214497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:03,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:03,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:03,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999430049] [2022-11-02 20:55:03,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:03,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:55:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:03,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:55:03,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:03,969 INFO L87 Difference]: Start difference. First operand 338 states and 436 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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 20:55:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:05,039 INFO L93 Difference]: Finished difference Result 860 states and 1165 transitions. [2022-11-02 20:55:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:55:05,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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 20:55:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:05,042 INFO L225 Difference]: With dead ends: 860 [2022-11-02 20:55:05,043 INFO L226 Difference]: Without dead ends: 691 [2022-11-02 20:55:05,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:55:05,044 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 1211 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:05,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1897 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:55:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-11-02 20:55:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 275. [2022-11-02 20:55:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 268 states have (on average 1.3395522388059702) internal successors, (359), 274 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 359 transitions. [2022-11-02 20:55:05,117 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 359 transitions. Word has length 66 [2022-11-02 20:55:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:05,117 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 359 transitions. [2022-11-02 20:55:05,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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 20:55:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 359 transitions. [2022-11-02 20:55:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:55:05,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:05,119 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 20:55:05,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:55:05,119 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:05,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1787778406, now seen corresponding path program 1 times [2022-11-02 20:55:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:05,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116929542] [2022-11-02 20:55:05,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:05,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:05,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:05,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116929542] [2022-11-02 20:55:05,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116929542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:05,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:05,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:55:05,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301924027] [2022-11-02 20:55:05,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:05,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:55:05,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:05,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:05,666 INFO L87 Difference]: Start difference. First operand 275 states and 359 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 20:55:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:06,844 INFO L93 Difference]: Finished difference Result 1019 states and 1448 transitions. [2022-11-02 20:55:06,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:55:06,844 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 20:55:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:06,848 INFO L225 Difference]: With dead ends: 1019 [2022-11-02 20:55:06,848 INFO L226 Difference]: Without dead ends: 891 [2022-11-02 20:55:06,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:55:06,850 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 1478 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:06,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 2349 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:55:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-11-02 20:55:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 253. [2022-11-02 20:55:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 248 states have (on average 1.3266129032258065) internal successors, (329), 252 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 329 transitions. [2022-11-02 20:55:06,942 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 329 transitions. Word has length 66 [2022-11-02 20:55:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:06,943 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 329 transitions. [2022-11-02 20:55:06,943 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 20:55:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 329 transitions. [2022-11-02 20:55:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:55:06,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:06,944 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 20:55:06,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:55:06,945 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 20:55:06,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1127331716, now seen corresponding path program 1 times [2022-11-02 20:55:06,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:06,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733071846] [2022-11-02 20:55:06,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:06,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:08,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:08,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733071846] [2022-11-02 20:55:08,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733071846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:08,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:08,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-02 20:55:08,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72874674] [2022-11-02 20:55:08,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:08,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:55:08,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:55:08,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:55:08,478 INFO L87 Difference]: Start difference. First operand 253 states and 329 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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 20:55:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:11,704 INFO L93 Difference]: Finished difference Result 426 states and 553 transitions. [2022-11-02 20:55:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:55:11,705 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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 20:55:11,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:11,707 INFO L225 Difference]: With dead ends: 426 [2022-11-02 20:55:11,707 INFO L226 Difference]: Without dead ends: 422 [2022-11-02 20:55:11,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2022-11-02 20:55:11,709 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 621 mSDsluCounter, 2382 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:11,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 2548 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:55:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-11-02 20:55:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 259. [2022-11-02 20:55:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 254 states have (on average 1.3267716535433072) internal successors, (337), 258 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 337 transitions. [2022-11-02 20:55:11,800 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 337 transitions. Word has length 66 [2022-11-02 20:55:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:11,801 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 337 transitions. [2022-11-02 20:55:11,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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 20:55:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 337 transitions. [2022-11-02 20:55:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:55:11,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:11,802 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 20:55:11,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:55:11,803 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:11,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash -653185432, now seen corresponding path program 1 times [2022-11-02 20:55:11,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:11,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839161733] [2022-11-02 20:55:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:11,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:12,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:12,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839161733] [2022-11-02 20:55:12,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839161733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:12,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:12,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-02 20:55:12,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405397580] [2022-11-02 20:55:12,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:12,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:55:12,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:55:12,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:55:12,991 INFO L87 Difference]: Start difference. First operand 259 states and 337 transitions. Second operand has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 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 20:55:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:14,929 INFO L93 Difference]: Finished difference Result 383 states and 513 transitions. [2022-11-02 20:55:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:55:14,930 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 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 20:55:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:14,930 INFO L225 Difference]: With dead ends: 383 [2022-11-02 20:55:14,930 INFO L226 Difference]: Without dead ends: 270 [2022-11-02 20:55:14,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=312, Invalid=1494, Unknown=0, NotChecked=0, Total=1806 [2022-11-02 20:55:14,939 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 657 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:14,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 2043 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:55:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-02 20:55:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 258. [2022-11-02 20:55:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 253 states have (on average 1.3201581027667983) internal successors, (334), 257 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 334 transitions. [2022-11-02 20:55:15,042 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 334 transitions. Word has length 66 [2022-11-02 20:55:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:15,042 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 334 transitions. [2022-11-02 20:55:15,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 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 20:55:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 334 transitions. [2022-11-02 20:55:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:55:15,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:15,044 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] [2022-11-02 20:55:15,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:55:15,044 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:15,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1241294901, now seen corresponding path program 1 times [2022-11-02 20:55:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:15,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557716530] [2022-11-02 20:55:15,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:15,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:15,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557716530] [2022-11-02 20:55:15,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557716530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:15,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:15,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-02 20:55:15,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065852286] [2022-11-02 20:55:15,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:15,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:55:15,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:15,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:55:15,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:55:15,939 INFO L87 Difference]: Start difference. First operand 258 states and 334 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:18,014 INFO L93 Difference]: Finished difference Result 579 states and 776 transitions. [2022-11-02 20:55:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:55:18,015 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-11-02 20:55:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:18,019 INFO L225 Difference]: With dead ends: 579 [2022-11-02 20:55:18,019 INFO L226 Difference]: Without dead ends: 575 [2022-11-02 20:55:18,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:55:18,020 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 1260 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:18,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 2038 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:55:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-11-02 20:55:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 258. [2022-11-02 20:55:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 253 states have (on average 1.3201581027667983) internal successors, (334), 257 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 334 transitions. [2022-11-02 20:55:18,126 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 334 transitions. Word has length 67 [2022-11-02 20:55:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:18,126 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 334 transitions. [2022-11-02 20:55:18,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 334 transitions. [2022-11-02 20:55:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:55:18,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:18,128 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] [2022-11-02 20:55:18,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:55:18,128 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:18,129 INFO L85 PathProgramCache]: Analyzing trace with hash -539222247, now seen corresponding path program 1 times [2022-11-02 20:55:18,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:18,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938421018] [2022-11-02 20:55:18,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:18,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:19,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938421018] [2022-11-02 20:55:19,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938421018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:19,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:19,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-02 20:55:19,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952240548] [2022-11-02 20:55:19,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:19,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:55:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:19,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:55:19,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:55:19,096 INFO L87 Difference]: Start difference. First operand 258 states and 334 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:20,302 INFO L93 Difference]: Finished difference Result 391 states and 521 transitions. [2022-11-02 20:55:20,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:55:20,306 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-11-02 20:55:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:20,308 INFO L225 Difference]: With dead ends: 391 [2022-11-02 20:55:20,308 INFO L226 Difference]: Without dead ends: 278 [2022-11-02 20:55:20,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:55:20,309 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 191 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:20,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 2266 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:55:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-02 20:55:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 249. [2022-11-02 20:55:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.3155737704918034) internal successors, (321), 248 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 321 transitions. [2022-11-02 20:55:20,399 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 321 transitions. Word has length 67 [2022-11-02 20:55:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:20,399 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 321 transitions. [2022-11-02 20:55:20,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 321 transitions. [2022-11-02 20:55:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:55:20,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:20,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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:20,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:55:20,401 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash -710008920, now seen corresponding path program 1 times [2022-11-02 20:55:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:20,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794034615] [2022-11-02 20:55:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:20,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:20,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794034615] [2022-11-02 20:55:20,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794034615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:20,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:20,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:55:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499358772] [2022-11-02 20:55:20,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:20,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:55:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:20,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:55:20,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:55:20,612 INFO L87 Difference]: Start difference. First operand 249 states and 321 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:21,278 INFO L93 Difference]: Finished difference Result 539 states and 733 transitions. [2022-11-02 20:55:21,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:55:21,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-11-02 20:55:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:21,280 INFO L225 Difference]: With dead ends: 539 [2022-11-02 20:55:21,281 INFO L226 Difference]: Without dead ends: 403 [2022-11-02 20:55:21,281 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 20:55:21,283 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 707 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:21,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 618 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:55:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-11-02 20:55:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 249. [2022-11-02 20:55:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.3073770491803278) internal successors, (319), 248 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 319 transitions. [2022-11-02 20:55:21,408 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 319 transitions. Word has length 67 [2022-11-02 20:55:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:21,408 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 319 transitions. [2022-11-02 20:55:21,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 319 transitions. [2022-11-02 20:55:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:55:21,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:21,410 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] [2022-11-02 20:55:21,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:55:21,410 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:21,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:21,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1303055616, now seen corresponding path program 1 times [2022-11-02 20:55:21,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:21,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827244753] [2022-11-02 20:55:21,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:21,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:21,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827244753] [2022-11-02 20:55:21,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827244753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:21,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:21,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:21,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148133640] [2022-11-02 20:55:21,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:21,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:55:21,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:21,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:21,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:21,817 INFO L87 Difference]: Start difference. First operand 249 states and 319 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:23,442 INFO L93 Difference]: Finished difference Result 693 states and 951 transitions. [2022-11-02 20:55:23,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:55:23,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-11-02 20:55:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:23,448 INFO L225 Difference]: With dead ends: 693 [2022-11-02 20:55:23,448 INFO L226 Difference]: Without dead ends: 686 [2022-11-02 20:55:23,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:55:23,450 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 1524 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:23,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 830 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:55:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-11-02 20:55:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 249. [2022-11-02 20:55:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.3032786885245902) internal successors, (318), 248 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 20:55:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 318 transitions. [2022-11-02 20:55:23,603 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 318 transitions. Word has length 67 [2022-11-02 20:55:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:23,603 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 318 transitions. [2022-11-02 20:55:23,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 318 transitions. [2022-11-02 20:55:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:55:23,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:23,604 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] [2022-11-02 20:55:23,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:55:23,605 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:23,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 926661436, now seen corresponding path program 1 times [2022-11-02 20:55:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:23,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616013084] [2022-11-02 20:55:23,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:23,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:23,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:23,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616013084] [2022-11-02 20:55:23,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616013084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:23,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:23,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:23,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783826015] [2022-11-02 20:55:23,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:23,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:55:23,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:23,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:55:23,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:23,986 INFO L87 Difference]: Start difference. First operand 249 states and 318 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:24,782 INFO L93 Difference]: Finished difference Result 411 states and 536 transitions. [2022-11-02 20:55:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:55:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-11-02 20:55:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:24,785 INFO L225 Difference]: With dead ends: 411 [2022-11-02 20:55:24,785 INFO L226 Difference]: Without dead ends: 407 [2022-11-02 20:55:24,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:55:24,786 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 596 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:24,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 1415 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:55:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-02 20:55:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 243. [2022-11-02 20:55:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 239 states have (on average 1.301255230125523) internal successors, (311), 242 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 311 transitions. [2022-11-02 20:55:24,926 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 311 transitions. Word has length 67 [2022-11-02 20:55:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:24,926 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 311 transitions. [2022-11-02 20:55:24,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 311 transitions. [2022-11-02 20:55:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:55:24,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:24,928 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] [2022-11-02 20:55:24,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:55:24,928 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash 763644804, now seen corresponding path program 1 times [2022-11-02 20:55:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:24,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089880978] [2022-11-02 20:55:24,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:24,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:25,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:25,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089880978] [2022-11-02 20:55:25,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089880978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:25,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:25,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:55:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222743790] [2022-11-02 20:55:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:25,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:55:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:25,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:25,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:25,404 INFO L87 Difference]: Start difference. First operand 243 states and 311 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:26,130 INFO L93 Difference]: Finished difference Result 393 states and 522 transitions. [2022-11-02 20:55:26,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:55:26,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-11-02 20:55:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:26,133 INFO L225 Difference]: With dead ends: 393 [2022-11-02 20:55:26,133 INFO L226 Difference]: Without dead ends: 361 [2022-11-02 20:55:26,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:55:26,134 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 636 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:26,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1468 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:55:26,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-02 20:55:26,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 211. [2022-11-02 20:55:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 209 states have (on average 1.3157894736842106) internal successors, (275), 210 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 275 transitions. [2022-11-02 20:55:26,266 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 275 transitions. Word has length 67 [2022-11-02 20:55:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:26,266 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 275 transitions. [2022-11-02 20:55:26,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 275 transitions. [2022-11-02 20:55:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 20:55:26,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:26,267 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 20:55:26,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:55:26,267 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:26,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:26,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1308874992, now seen corresponding path program 1 times [2022-11-02 20:55:26,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:26,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735142212] [2022-11-02 20:55:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:26,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:26,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:26,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735142212] [2022-11-02 20:55:26,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735142212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:26,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:26,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:55:26,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268279161] [2022-11-02 20:55:26,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:26,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:55:26,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:26,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:55:26,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:55:26,838 INFO L87 Difference]: Start difference. First operand 211 states and 275 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 20:55:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:28,754 INFO L93 Difference]: Finished difference Result 1031 states and 1479 transitions. [2022-11-02 20:55:28,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:55:28,754 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 20:55:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:28,760 INFO L225 Difference]: With dead ends: 1031 [2022-11-02 20:55:28,760 INFO L226 Difference]: Without dead ends: 1025 [2022-11-02 20:55:28,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:55:28,761 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 1013 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:28,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 3130 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:55:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2022-11-02 20:55:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 205. [2022-11-02 20:55:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.3137254901960784) internal successors, (268), 204 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 268 transitions. [2022-11-02 20:55:28,894 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 268 transitions. Word has length 69 [2022-11-02 20:55:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:28,894 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 268 transitions. [2022-11-02 20:55:28,894 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 20:55:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 268 transitions. [2022-11-02 20:55:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 20:55:28,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:28,896 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] [2022-11-02 20:55:28,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:55:28,896 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:28,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:28,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1208516883, now seen corresponding path program 1 times [2022-11-02 20:55:28,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:28,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656289725] [2022-11-02 20:55:28,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:28,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:29,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:29,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656289725] [2022-11-02 20:55:29,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656289725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:29,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:29,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:55:29,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472498718] [2022-11-02 20:55:29,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:29,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:29,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:29,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:29,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:29,007 INFO L87 Difference]: Start difference. First operand 205 states and 268 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:29,897 INFO L93 Difference]: Finished difference Result 1053 states and 1548 transitions. [2022-11-02 20:55:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:55:29,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-11-02 20:55:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:29,900 INFO L225 Difference]: With dead ends: 1053 [2022-11-02 20:55:29,900 INFO L226 Difference]: Without dead ends: 947 [2022-11-02 20:55:29,901 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 20:55:29,901 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 905 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 961 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 20:55:29,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 961 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:55:29,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-11-02 20:55:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 309. [2022-11-02 20:55:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.3733766233766234) internal successors, (423), 308 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 423 transitions. [2022-11-02 20:55:30,101 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 423 transitions. Word has length 92 [2022-11-02 20:55:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:30,101 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 423 transitions. [2022-11-02 20:55:30,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 423 transitions. [2022-11-02 20:55:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:55:30,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:30,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:30,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:55:30,103 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1324206254, now seen corresponding path program 1 times [2022-11-02 20:55:30,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:30,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822982681] [2022-11-02 20:55:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:30,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:30,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822982681] [2022-11-02 20:55:30,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822982681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:30,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:30,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:55:30,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813907454] [2022-11-02 20:55:30,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:30,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:30,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:30,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:30,242 INFO L87 Difference]: Start difference. First operand 309 states and 423 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:31,044 INFO L93 Difference]: Finished difference Result 1255 states and 1839 transitions. [2022-11-02 20:55:31,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:31,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:31,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:31,048 INFO L225 Difference]: With dead ends: 1255 [2022-11-02 20:55:31,048 INFO L226 Difference]: Without dead ends: 1045 [2022-11-02 20:55:31,049 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 20:55:31,049 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 655 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:31,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 668 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:55:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2022-11-02 20:55:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 517. [2022-11-02 20:55:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.4244186046511629) internal successors, (735), 516 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 735 transitions. [2022-11-02 20:55:31,393 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 735 transitions. Word has length 94 [2022-11-02 20:55:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:31,394 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 735 transitions. [2022-11-02 20:55:31,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 735 transitions. [2022-11-02 20:55:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:55:31,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:31,395 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 20:55:31,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:55:31,396 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1309824789, now seen corresponding path program 1 times [2022-11-02 20:55:31,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:31,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266967882] [2022-11-02 20:55:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:31,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:31,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266967882] [2022-11-02 20:55:31,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266967882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:31,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:31,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:55:31,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574119185] [2022-11-02 20:55:31,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:31,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:31,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:31,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:31,602 INFO L87 Difference]: Start difference. First operand 517 states and 735 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:32,075 INFO L93 Difference]: Finished difference Result 937 states and 1363 transitions. [2022-11-02 20:55:32,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:32,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:32,078 INFO L225 Difference]: With dead ends: 937 [2022-11-02 20:55:32,078 INFO L226 Difference]: Without dead ends: 519 [2022-11-02 20:55:32,079 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 20:55:32,080 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 295 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:32,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 460 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:55:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-11-02 20:55:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 517. [2022-11-02 20:55:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.4166666666666667) internal successors, (731), 516 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 731 transitions. [2022-11-02 20:55:32,407 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 731 transitions. Word has length 94 [2022-11-02 20:55:32,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:32,407 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 731 transitions. [2022-11-02 20:55:32,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 731 transitions. [2022-11-02 20:55:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:55:32,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:32,409 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 20:55:32,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:55:32,409 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:32,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash 570084468, now seen corresponding path program 1 times [2022-11-02 20:55:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:32,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809125866] [2022-11-02 20:55:32,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:32,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:32,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:32,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809125866] [2022-11-02 20:55:32,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809125866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:32,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:32,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:32,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704847250] [2022-11-02 20:55:32,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:32,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:32,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:32,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:32,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:32,472 INFO L87 Difference]: Start difference. First operand 517 states and 731 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 20:55:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:33,125 INFO L93 Difference]: Finished difference Result 1301 states and 1889 transitions. [2022-11-02 20:55:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:33,126 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 20:55:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:33,128 INFO L225 Difference]: With dead ends: 1301 [2022-11-02 20:55:33,128 INFO L226 Difference]: Without dead ends: 883 [2022-11-02 20:55:33,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:33,129 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 90 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:33,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 253 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:55:33,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-11-02 20:55:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 873. [2022-11-02 20:55:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.4185779816513762) internal successors, (1237), 872 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1237 transitions. [2022-11-02 20:55:33,913 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1237 transitions. Word has length 94 [2022-11-02 20:55:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:33,913 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1237 transitions. [2022-11-02 20:55:33,914 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 20:55:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1237 transitions. [2022-11-02 20:55:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:55:33,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:33,915 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 20:55:33,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:55:33,916 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash -337360546, now seen corresponding path program 1 times [2022-11-02 20:55:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:33,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463658349] [2022-11-02 20:55:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:34,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:34,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463658349] [2022-11-02 20:55:34,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463658349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:34,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:34,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:55:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961289215] [2022-11-02 20:55:34,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:34,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:34,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:34,043 INFO L87 Difference]: Start difference. First operand 873 states and 1237 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:36,240 INFO L93 Difference]: Finished difference Result 2621 states and 3786 transitions. [2022-11-02 20:55:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:36,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:36,255 INFO L225 Difference]: With dead ends: 2621 [2022-11-02 20:55:36,255 INFO L226 Difference]: Without dead ends: 2233 [2022-11-02 20:55:36,256 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 20:55:36,257 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 622 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:36,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 690 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:55:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2022-11-02 20:55:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1453. [2022-11-02 20:55:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1452 states have (on average 1.4318181818181819) internal successors, (2079), 1452 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2079 transitions. [2022-11-02 20:55:37,580 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2079 transitions. Word has length 94 [2022-11-02 20:55:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:37,580 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 2079 transitions. [2022-11-02 20:55:37,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2079 transitions. [2022-11-02 20:55:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:55:37,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:37,582 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 20:55:37,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:55:37,583 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:37,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1456780136, now seen corresponding path program 1 times [2022-11-02 20:55:37,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:37,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678920955] [2022-11-02 20:55:37,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:37,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:37,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:37,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678920955] [2022-11-02 20:55:37,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678920955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:37,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:37,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:55:37,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228884563] [2022-11-02 20:55:37,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:37,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:37,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:37,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:37,703 INFO L87 Difference]: Start difference. First operand 1453 states and 2079 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:40,076 INFO L93 Difference]: Finished difference Result 3007 states and 4348 transitions. [2022-11-02 20:55:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:40,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:40,082 INFO L225 Difference]: With dead ends: 3007 [2022-11-02 20:55:40,082 INFO L226 Difference]: Without dead ends: 2619 [2022-11-02 20:55:40,083 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 20:55:40,083 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 588 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:40,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 755 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:55:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2022-11-02 20:55:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 1839. [2022-11-02 20:55:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1838 states have (on average 1.4368879216539716) internal successors, (2641), 1838 states have internal predecessors, (2641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2641 transitions. [2022-11-02 20:55:41,467 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2641 transitions. Word has length 94 [2022-11-02 20:55:41,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:41,468 INFO L495 AbstractCegarLoop]: Abstraction has 1839 states and 2641 transitions. [2022-11-02 20:55:41,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 20:55:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2641 transitions. [2022-11-02 20:55:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 20:55:41,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:41,470 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 20:55:41,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:55:41,470 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:41,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1890695249, now seen corresponding path program 1 times [2022-11-02 20:55:41,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:41,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271516321] [2022-11-02 20:55:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:41,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:41,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271516321] [2022-11-02 20:55:41,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271516321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:41,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:41,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119869259] [2022-11-02 20:55:41,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:41,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:41,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:41,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:41,588 INFO L87 Difference]: Start difference. First operand 1839 states and 2641 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 20:55:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:44,658 INFO L93 Difference]: Finished difference Result 5175 states and 7455 transitions. [2022-11-02 20:55:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:44,659 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 20:55:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:44,673 INFO L225 Difference]: With dead ends: 5175 [2022-11-02 20:55:44,673 INFO L226 Difference]: Without dead ends: 3435 [2022-11-02 20:55:44,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:44,677 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 73 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:44,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:55:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2022-11-02 20:55:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3289. [2022-11-02 20:55:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 3288 states have (on average 1.4309610705596107) internal successors, (4705), 3288 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 4705 transitions. [2022-11-02 20:55:47,430 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 4705 transitions. Word has length 95 [2022-11-02 20:55:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:47,431 INFO L495 AbstractCegarLoop]: Abstraction has 3289 states and 4705 transitions. [2022-11-02 20:55:47,431 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 20:55:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 4705 transitions. [2022-11-02 20:55:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-02 20:55:47,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:47,432 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 20:55:47,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:55:47,433 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:47,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:47,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1608306199, now seen corresponding path program 1 times [2022-11-02 20:55:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:47,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842368728] [2022-11-02 20:55:47,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:47,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:47,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:47,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842368728] [2022-11-02 20:55:47,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842368728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:47,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:47,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511411947] [2022-11-02 20:55:47,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:47,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:47,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:47,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:47,538 INFO L87 Difference]: Start difference. First operand 3289 states and 4705 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 20:55:52,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:52,841 INFO L93 Difference]: Finished difference Result 9381 states and 13395 transitions. [2022-11-02 20:55:52,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:52,842 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 20:55:52,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:52,855 INFO L225 Difference]: With dead ends: 9381 [2022-11-02 20:55:52,855 INFO L226 Difference]: Without dead ends: 6191 [2022-11-02 20:55:52,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:52,860 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 66 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:52,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:55:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2022-11-02 20:55:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 5901. [2022-11-02 20:55:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5901 states, 5900 states have (on average 1.4177966101694914) internal successors, (8365), 5900 states have internal predecessors, (8365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5901 states to 5901 states and 8365 transitions. [2022-11-02 20:55:58,117 INFO L78 Accepts]: Start accepts. Automaton has 5901 states and 8365 transitions. Word has length 96 [2022-11-02 20:55:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:58,118 INFO L495 AbstractCegarLoop]: Abstraction has 5901 states and 8365 transitions. [2022-11-02 20:55:58,118 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 20:55:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 5901 states and 8365 transitions. [2022-11-02 20:55:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-02 20:55:58,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:58,119 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 20:55:58,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:55:58,120 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:55:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash -916899152, now seen corresponding path program 1 times [2022-11-02 20:55:58,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:58,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383786417] [2022-11-02 20:55:58,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:58,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:58,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:58,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383786417] [2022-11-02 20:55:58,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383786417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:58,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:58,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:58,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943569290] [2022-11-02 20:55:58,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:58,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:58,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:58,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:58,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:58,223 INFO L87 Difference]: Start difference. First operand 5901 states and 8365 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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 20:56:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:07,648 INFO L93 Difference]: Finished difference Result 16929 states and 23871 transitions. [2022-11-02 20:56:07,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:07,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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 20:56:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:07,671 INFO L225 Difference]: With dead ends: 16929 [2022-11-02 20:56:07,671 INFO L226 Difference]: Without dead ends: 11127 [2022-11-02 20:56:07,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:07,679 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 56 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 335 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 20:56:07,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 335 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:56:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11127 states. [2022-11-02 20:56:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11127 to 10549. [2022-11-02 20:56:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10549 states, 10548 states have (on average 1.3982745544178992) internal successors, (14749), 10548 states have internal predecessors, (14749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10549 states to 10549 states and 14749 transitions. [2022-11-02 20:56:17,152 INFO L78 Accepts]: Start accepts. Automaton has 10549 states and 14749 transitions. Word has length 97 [2022-11-02 20:56:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:17,153 INFO L495 AbstractCegarLoop]: Abstraction has 10549 states and 14749 transitions. [2022-11-02 20:56:17,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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 20:56:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 10549 states and 14749 transitions. [2022-11-02 20:56:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 20:56:17,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:17,154 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 20:56:17,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:56:17,155 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:56:17,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:17,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2063595932, now seen corresponding path program 1 times [2022-11-02 20:56:17,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:17,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268825549] [2022-11-02 20:56:17,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:17,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:17,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268825549] [2022-11-02 20:56:17,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268825549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:17,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:17,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:56:17,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213206015] [2022-11-02 20:56:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:17,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:17,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:17,363 INFO L87 Difference]: Start difference. First operand 10549 states and 14749 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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 20:56:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:33,977 INFO L93 Difference]: Finished difference Result 18659 states and 25853 transitions. [2022-11-02 20:56:33,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:56:33,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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 20:56:33,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:34,008 INFO L225 Difference]: With dead ends: 18659 [2022-11-02 20:56:34,009 INFO L226 Difference]: Without dead ends: 18657 [2022-11-02 20:56:34,012 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 20:56:34,013 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 260 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 847 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:34,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 847 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:56:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18657 states. [2022-11-02 20:56:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18657 to 10933. [2022-11-02 20:56:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10933 states, 10932 states have (on average 1.3769667032564947) internal successors, (15053), 10932 states have internal predecessors, (15053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10933 states to 10933 states and 15053 transitions. [2022-11-02 20:56:44,614 INFO L78 Accepts]: Start accepts. Automaton has 10933 states and 15053 transitions. Word has length 98 [2022-11-02 20:56:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:44,615 INFO L495 AbstractCegarLoop]: Abstraction has 10933 states and 15053 transitions. [2022-11-02 20:56:44,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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 20:56:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 10933 states and 15053 transitions. [2022-11-02 20:56:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 20:56:44,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:44,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:44,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:56:44,617 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:56:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash -777753176, now seen corresponding path program 1 times [2022-11-02 20:56:44,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:44,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342324054] [2022-11-02 20:56:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:44,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342324054] [2022-11-02 20:56:44,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342324054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:44,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:44,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:56:44,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254898474] [2022-11-02 20:56:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:44,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:44,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:44,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:44,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:44,734 INFO L87 Difference]: Start difference. First operand 10933 states and 15053 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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 20:57:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:01,355 INFO L93 Difference]: Finished difference Result 20607 states and 28498 transitions. [2022-11-02 20:57:01,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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 20:57:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:01,385 INFO L225 Difference]: With dead ends: 20607 [2022-11-02 20:57:01,385 INFO L226 Difference]: Without dead ends: 18189 [2022-11-02 20:57:01,391 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 20:57:01,392 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 650 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:01,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 748 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:01,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18189 states. [2022-11-02 20:57:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18189 to 13349. [2022-11-02 20:57:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13349 states, 13348 states have (on average 1.3770602337428828) internal successors, (18381), 13348 states have internal predecessors, (18381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13349 states to 13349 states and 18381 transitions. [2022-11-02 20:57:13,273 INFO L78 Accepts]: Start accepts. Automaton has 13349 states and 18381 transitions. Word has length 98 [2022-11-02 20:57:13,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:13,274 INFO L495 AbstractCegarLoop]: Abstraction has 13349 states and 18381 transitions. [2022-11-02 20:57:13,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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 20:57:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 13349 states and 18381 transitions. [2022-11-02 20:57:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 20:57:13,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:13,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:13,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:57:13,276 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:57:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1173003609, now seen corresponding path program 1 times [2022-11-02 20:57:13,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:13,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962283699] [2022-11-02 20:57:13,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:13,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:13,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962283699] [2022-11-02 20:57:13,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962283699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:13,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:13,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:13,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260153436] [2022-11-02 20:57:13,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:13,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:13,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:13,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:13,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:13,376 INFO L87 Difference]: Start difference. First operand 13349 states and 18381 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:32,926 INFO L93 Difference]: Finished difference Result 34745 states and 47783 transitions. [2022-11-02 20:57:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:32,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-11-02 20:57:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:32,952 INFO L225 Difference]: With dead ends: 34745 [2022-11-02 20:57:32,952 INFO L226 Difference]: Without dead ends: 21495 [2022-11-02 20:57:32,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:32,961 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 77 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:32,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 338 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21495 states. [2022-11-02 20:57:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21495 to 20085. [2022-11-02 20:57:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20085 states, 20084 states have (on average 1.3553574985062737) internal successors, (27221), 20084 states have internal predecessors, (27221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 27221 transitions. [2022-11-02 20:57:50,611 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 27221 transitions. Word has length 99 [2022-11-02 20:57:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:50,611 INFO L495 AbstractCegarLoop]: Abstraction has 20085 states and 27221 transitions. [2022-11-02 20:57:50,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 27221 transitions. [2022-11-02 20:57:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-02 20:57:50,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:50,617 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, 1] [2022-11-02 20:57:50,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:57:50,617 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:57:50,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1824588018, now seen corresponding path program 1 times [2022-11-02 20:57:50,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:50,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584098590] [2022-11-02 20:57:50,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:50,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:50,718 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 20:57:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:50,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584098590] [2022-11-02 20:57:50,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584098590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:50,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:50,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:50,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824087048] [2022-11-02 20:57:50,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:50,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:50,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:50,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:50,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:50,721 INFO L87 Difference]: Start difference. First operand 20085 states and 27221 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:10,440 INFO L93 Difference]: Finished difference Result 40073 states and 54335 transitions. [2022-11-02 20:58:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:10,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2022-11-02 20:58:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:10,467 INFO L225 Difference]: With dead ends: 40073 [2022-11-02 20:58:10,467 INFO L226 Difference]: Without dead ends: 20087 [2022-11-02 20:58:10,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:10,480 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 69 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 311 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 20:58:10,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 311 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20087 states. [2022-11-02 20:58:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20087 to 20085. [2022-11-02 20:58:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20085 states, 20084 states have (on average 1.3378311093407689) internal successors, (26869), 20084 states have internal predecessors, (26869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 26869 transitions. [2022-11-02 20:58:28,617 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 26869 transitions. Word has length 125 [2022-11-02 20:58:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:28,618 INFO L495 AbstractCegarLoop]: Abstraction has 20085 states and 26869 transitions. [2022-11-02 20:58:28,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 26869 transitions. [2022-11-02 20:58:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-02 20:58:28,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:28,622 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, 1] [2022-11-02 20:58:28,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:58:28,622 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-02 20:58:28,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:28,623 INFO L85 PathProgramCache]: Analyzing trace with hash -277387224, now seen corresponding path program 1 times [2022-11-02 20:58:28,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:28,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161758978] [2022-11-02 20:58:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,209 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 20:58:29,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:29,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161758978] [2022-11-02 20:58:29,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161758978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:29,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731063916] [2022-11-02 20:58:29,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:29,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:29,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:29,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:29,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f9401f-88ab-43a6-bb69-f9c46304decf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:58:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:58:29,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:30,259 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 20:58:30,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:31,540 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 20:58:31,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731063916] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:31,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:31,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-11-02 20:58:31,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343573327] [2022-11-02 20:58:31,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:31,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:58:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:58:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:58:31,543 INFO L87 Difference]: Start difference. First operand 20085 states and 26869 transitions. Second operand has 27 states, 27 states have (on average 10.962962962962964) internal successors, (296), 26 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)