./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-sorted-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-sorted-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e45b14428dafe2f20aeac8c38d2592befc15b6791b0365935474ded4fd47d0f2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:01:57,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:01:57,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:01:57,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:01:57,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:01:57,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:01:57,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:01:57,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:01:57,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:01:57,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:01:57,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:01:57,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:01:57,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:01:57,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:01:57,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:01:57,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:01:57,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:01:57,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:01:57,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:01:57,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:01:57,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:01:57,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:01:57,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:01:57,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:01:57,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:01:57,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:01:57,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:01:57,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:01:57,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:01:57,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:01:57,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:01:57,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:01:57,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:01:57,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:01:57,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:01:57,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:01:57,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:01:57,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:01:57,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:01:57,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:01:57,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:01:57,615 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-02 21:01:57,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:01:57,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:01:57,648 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:01:57,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:01:57,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:01:57,653 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:01:57,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:01:57,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:01:57,654 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:01:57,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:01:57,656 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:01:57,656 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:01:57,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:01:57,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:01:57,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:01:57,657 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 21:01:57,658 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 21:01:57,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:01:57,658 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 21:01:57,658 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:01:57,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:01:57,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:01:57,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:01:57,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:01:57,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:01:57,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:01:57,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:01:57,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:01:57,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:01:57,662 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/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 valid-memcleanup) ) 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 -> e45b14428dafe2f20aeac8c38d2592befc15b6791b0365935474ded4fd47d0f2 [2022-11-02 21:01:57,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:01:58,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:01:58,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:01:58,025 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:01:58,026 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:01:58,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/forester-heap/sll-sorted-1.i [2022-11-02 21:01:58,128 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/data/0c5608900/16cef285134c4923acade33ddc4c1693/FLAG4ebe9fbb9 [2022-11-02 21:01:58,672 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:01:58,673 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i [2022-11-02 21:01:58,686 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/data/0c5608900/16cef285134c4923acade33ddc4c1693/FLAG4ebe9fbb9 [2022-11-02 21:01:58,974 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/data/0c5608900/16cef285134c4923acade33ddc4c1693 [2022-11-02 21:01:58,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:01:58,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:01:58,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:01:58,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:01:58,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:01:58,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:01:58" (1/1) ... [2022-11-02 21:01:58,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f20ab28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:58, skipping insertion in model container [2022-11-02 21:01:58,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:01:58" (1/1) ... [2022-11-02 21:01:59,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:01:59,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:01:59,447 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22317,22330] [2022-11-02 21:01:59,461 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22547,22560] [2022-11-02 21:01:59,472 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22877,22890] [2022-11-02 21:01:59,475 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22941,22954] [2022-11-02 21:01:59,477 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[23072,23085] [2022-11-02 21:01:59,479 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[23136,23149] [2022-11-02 21:01:59,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:01:59,504 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:01:59,534 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22317,22330] [2022-11-02 21:01:59,536 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22547,22560] [2022-11-02 21:01:59,540 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22877,22890] [2022-11-02 21:01:59,540 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22941,22954] [2022-11-02 21:01:59,542 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[23072,23085] [2022-11-02 21:01:59,543 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_c9b1015c-3005-42dd-95fd-4b7a9c511f65/sv-benchmarks/c/forester-heap/sll-sorted-1.i[23136,23149] [2022-11-02 21:01:59,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:01:59,570 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:01:59,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59 WrapperNode [2022-11-02 21:01:59,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:01:59,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:01:59,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:01:59,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:01:59,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (1/1) ... [2022-11-02 21:01:59,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (1/1) ... [2022-11-02 21:01:59,640 INFO L138 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 189 [2022-11-02 21:01:59,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:01:59,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:01:59,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:01:59,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:01:59,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (1/1) ... [2022-11-02 21:01:59,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (1/1) ... [2022-11-02 21:01:59,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (1/1) ... [2022-11-02 21:01:59,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (1/1) ... [2022-11-02 21:01:59,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (1/1) ... [2022-11-02 21:01:59,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (1/1) ... [2022-11-02 21:01:59,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (1/1) ... [2022-11-02 21:01:59,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (1/1) ... [2022-11-02 21:01:59,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:01:59,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:01:59,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:01:59,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:01:59,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (1/1) ... [2022-11-02 21:01:59,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:01:59,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:59,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:59,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:01:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:01:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:01:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:01:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:01:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:01:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:01:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:01:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:01:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:01:59,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:01:59,974 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:01:59,977 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:02:00,555 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:02:00,563 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:02:00,564 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-11-02 21:02:00,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:02:00 BoogieIcfgContainer [2022-11-02 21:02:00,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:02:00,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:02:00,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:02:00,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:02:00,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:01:58" (1/3) ... [2022-11-02 21:02:00,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1950e005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:02:00, skipping insertion in model container [2022-11-02 21:02:00,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:59" (2/3) ... [2022-11-02 21:02:00,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1950e005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:02:00, skipping insertion in model container [2022-11-02 21:02:00,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:02:00" (3/3) ... [2022-11-02 21:02:00,577 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted-1.i [2022-11-02 21:02:00,598 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:02:00,598 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2022-11-02 21:02:00,661 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:02:00,668 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@f270529, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:02:00,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2022-11-02 21:02:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 90 states have (on average 2.1555555555555554) internal successors, (194), 158 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 21:02:00,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:00,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 21:02:00,682 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 21:02:00,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:00,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460248689] [2022-11-02 21:02:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:00,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:00,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460248689] [2022-11-02 21:02:00,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460248689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:00,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:00,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:02:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044524628] [2022-11-02 21:02:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:00,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:00,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:00,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:00,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:00,991 INFO L87 Difference]: Start difference. First operand has 159 states, 90 states have (on average 2.1555555555555554) internal successors, (194), 158 states have internal predecessors, (194), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:01,219 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2022-11-02 21:02:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:01,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 21:02:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:01,234 INFO L225 Difference]: With dead ends: 163 [2022-11-02 21:02:01,235 INFO L226 Difference]: Without dead ends: 159 [2022-11-02 21:02:01,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:01,242 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:01,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 111 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:01,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-02 21:02:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2022-11-02 21:02:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 89 states have (on average 1.8651685393258426) internal successors, (166), 154 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2022-11-02 21:02:01,284 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 3 [2022-11-02 21:02:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:01,285 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2022-11-02 21:02:01,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2022-11-02 21:02:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 21:02:01,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:01,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 21:02:01,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:02:01,288 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:01,289 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 21:02:01,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:01,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505904058] [2022-11-02 21:02:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:01,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:01,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505904058] [2022-11-02 21:02:01,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505904058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:01,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:01,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:02:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026420152] [2022-11-02 21:02:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:01,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:01,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:01,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:01,380 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:01,508 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-11-02 21:02:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:01,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 21:02:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:01,510 INFO L225 Difference]: With dead ends: 157 [2022-11-02 21:02:01,511 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 21:02:01,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:01,512 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 149 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:01,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:02:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 21:02:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2022-11-02 21:02:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 89 states have (on average 1.8426966292134832) internal successors, (164), 152 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-11-02 21:02:01,526 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 3 [2022-11-02 21:02:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:01,526 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-11-02 21:02:01,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:01,527 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-11-02 21:02:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 21:02:01,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:01,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:01,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:02:01,528 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:01,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:01,529 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-11-02 21:02:01,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:01,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740487932] [2022-11-02 21:02:01,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:01,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:01,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:01,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740487932] [2022-11-02 21:02:01,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740487932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:01,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:01,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:02:01,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389672565] [2022-11-02 21:02:01,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:01,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:02:01,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:01,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:02:01,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:02:01,818 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:02,065 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2022-11-02 21:02:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:02:02,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-02 21:02:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:02,067 INFO L225 Difference]: With dead ends: 162 [2022-11-02 21:02:02,067 INFO L226 Difference]: Without dead ends: 162 [2022-11-02 21:02:02,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:02:02,068 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 264 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:02,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 84 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-02 21:02:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 151. [2022-11-02 21:02:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 103 states have (on average 1.6796116504854368) internal successors, (173), 150 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2022-11-02 21:02:02,077 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 8 [2022-11-02 21:02:02,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:02,078 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2022-11-02 21:02:02,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2022-11-02 21:02:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 21:02:02,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:02,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:02,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:02:02,079 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-11-02 21:02:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:02,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204129366] [2022-11-02 21:02:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:02,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:02,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204129366] [2022-11-02 21:02:02,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204129366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:02,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:02,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:02:02,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717814818] [2022-11-02 21:02:02,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:02,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:02:02,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:02,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:02:02,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:02:02,255 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:02,561 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2022-11-02 21:02:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:02:02,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-02 21:02:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:02,563 INFO L225 Difference]: With dead ends: 229 [2022-11-02 21:02:02,563 INFO L226 Difference]: Without dead ends: 229 [2022-11-02 21:02:02,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:02:02,565 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 299 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:02,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 138 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-02 21:02:02,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 197. [2022-11-02 21:02:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 149 states have (on average 1.5771812080536913) internal successors, (235), 196 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2022-11-02 21:02:02,577 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 8 [2022-11-02 21:02:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:02,578 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2022-11-02 21:02:02,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2022-11-02 21:02:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 21:02:02,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:02,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:02,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:02:02,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:02,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1117776432, now seen corresponding path program 1 times [2022-11-02 21:02:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:02,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948258210] [2022-11-02 21:02:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:02,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:02,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948258210] [2022-11-02 21:02:02,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948258210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:02,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:02,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:02:02,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012558551] [2022-11-02 21:02:02,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:02,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:02,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:02,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:02,624 INFO L87 Difference]: Start difference. First operand 197 states and 235 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:02,649 INFO L93 Difference]: Finished difference Result 237 states and 278 transitions. [2022-11-02 21:02:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:02,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-02 21:02:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:02,660 INFO L225 Difference]: With dead ends: 237 [2022-11-02 21:02:02,660 INFO L226 Difference]: Without dead ends: 237 [2022-11-02 21:02:02,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:02,662 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:02,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 211 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:02:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-02 21:02:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 207. [2022-11-02 21:02:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 159 states have (on average 1.5660377358490567) internal successors, (249), 206 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 249 transitions. [2022-11-02 21:02:02,672 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 249 transitions. Word has length 10 [2022-11-02 21:02:02,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:02,672 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 249 transitions. [2022-11-02 21:02:02,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 249 transitions. [2022-11-02 21:02:02,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 21:02:02,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:02,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:02,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:02:02,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-11-02 21:02:02,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:02,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215525620] [2022-11-02 21:02:02,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:02,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:02,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:02,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215525620] [2022-11-02 21:02:02,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215525620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:02,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:02,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:02:02,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841992549] [2022-11-02 21:02:02,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:02,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:02,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:02,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:02,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:02,945 INFO L87 Difference]: Start difference. First operand 207 states and 249 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:03,251 INFO L93 Difference]: Finished difference Result 213 states and 254 transitions. [2022-11-02 21:02:03,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:02:03,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 21:02:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:03,253 INFO L225 Difference]: With dead ends: 213 [2022-11-02 21:02:03,254 INFO L226 Difference]: Without dead ends: 213 [2022-11-02 21:02:03,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:03,255 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 100 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:03,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 356 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-02 21:02:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2022-11-02 21:02:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 159 states have (on average 1.5534591194968554) internal successors, (247), 205 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2022-11-02 21:02:03,277 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 12 [2022-11-02 21:02:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:03,277 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2022-11-02 21:02:03,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2022-11-02 21:02:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 21:02:03,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:03,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:03,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:02:03,279 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-11-02 21:02:03,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:03,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080534788] [2022-11-02 21:02:03,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:03,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080534788] [2022-11-02 21:02:03,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080534788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:03,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:03,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:02:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098288139] [2022-11-02 21:02:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:03,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:03,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:03,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:03,515 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:03,822 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2022-11-02 21:02:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:02:03,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 21:02:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:03,824 INFO L225 Difference]: With dead ends: 202 [2022-11-02 21:02:03,824 INFO L226 Difference]: Without dead ends: 202 [2022-11-02 21:02:03,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:03,825 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 15 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:03,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 434 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-02 21:02:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 196. [2022-11-02 21:02:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 195 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 234 transitions. [2022-11-02 21:02:03,831 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 234 transitions. Word has length 12 [2022-11-02 21:02:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:03,832 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 234 transitions. [2022-11-02 21:02:03,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 234 transitions. [2022-11-02 21:02:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 21:02:03,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:03,833 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:03,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:02:03,833 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:03,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:03,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1270421215, now seen corresponding path program 1 times [2022-11-02 21:02:03,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:03,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561761552] [2022-11-02 21:02:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:03,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:02:03,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:03,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561761552] [2022-11-02 21:02:03,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561761552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:03,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:03,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:02:03,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036822104] [2022-11-02 21:02:03,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:03,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:02:03,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:03,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:02:03,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:02:03,936 INFO L87 Difference]: Start difference. First operand 196 states and 234 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:04,083 INFO L93 Difference]: Finished difference Result 226 states and 249 transitions. [2022-11-02 21:02:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:02:04,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 21 [2022-11-02 21:02:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:04,087 INFO L225 Difference]: With dead ends: 226 [2022-11-02 21:02:04,088 INFO L226 Difference]: Without dead ends: 226 [2022-11-02 21:02:04,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:02:04,091 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 267 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:04,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 187 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:02:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-02 21:02:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 194. [2022-11-02 21:02:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 193 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2022-11-02 21:02:04,108 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 21 [2022-11-02 21:02:04,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:04,111 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2022-11-02 21:02:04,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:04,111 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2022-11-02 21:02:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 21:02:04,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:04,113 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:02:04,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:02:04,113 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:04,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:04,114 INFO L85 PathProgramCache]: Analyzing trace with hash -697189136, now seen corresponding path program 1 times [2022-11-02 21:02:04,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:04,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279333598] [2022-11-02 21:02:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:04,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:04,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:04,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279333598] [2022-11-02 21:02:04,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279333598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:02:04,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119218584] [2022-11-02 21:02:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:04,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:02:04,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:02:04,625 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:02:04,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:02:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:04,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 21:02:04,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:02:04,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:02:04,976 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:02:04,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 21:02:05,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:02:05,263 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:02:05,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 21:02:05,345 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:02:05,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 21:02:05,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:02:05,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 21:02:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:05,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:02:06,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:06,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-02 21:02:06,094 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:06,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-11-02 21:02:06,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-02 21:02:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:10,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119218584] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:02:10,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:02:10,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-02 21:02:10,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937895543] [2022-11-02 21:02:10,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:02:10,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 21:02:10,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:10,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 21:02:10,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=740, Unknown=7, NotChecked=0, Total=870 [2022-11-02 21:02:10,751 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:12,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:12,011 INFO L93 Difference]: Finished difference Result 389 states and 441 transitions. [2022-11-02 21:02:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:02:12,011 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 21:02:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:12,013 INFO L225 Difference]: With dead ends: 389 [2022-11-02 21:02:12,013 INFO L226 Difference]: Without dead ends: 389 [2022-11-02 21:02:12,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=279, Invalid=1196, Unknown=7, NotChecked=0, Total=1482 [2022-11-02 21:02:12,014 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1127 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1005 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:12,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 1280 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 883 Invalid, 0 Unknown, 1005 Unchecked, 0.8s Time] [2022-11-02 21:02:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-02 21:02:12,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 216. [2022-11-02 21:02:12,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 175 states have (on average 1.4685714285714286) internal successors, (257), 215 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 257 transitions. [2022-11-02 21:02:12,021 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 257 transitions. Word has length 27 [2022-11-02 21:02:12,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:12,022 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 257 transitions. [2022-11-02 21:02:12,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 257 transitions. [2022-11-02 21:02:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 21:02:12,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:12,023 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:02:12,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:02:12,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:02:12,224 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:12,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:12,224 INFO L85 PathProgramCache]: Analyzing trace with hash -697189135, now seen corresponding path program 1 times [2022-11-02 21:02:12,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:12,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070638435] [2022-11-02 21:02:12,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:12,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:12,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070638435] [2022-11-02 21:02:12,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070638435] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:02:12,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791640952] [2022-11-02 21:02:12,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:12,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:02:12,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:02:12,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:02:12,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:02:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:13,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 21:02:13,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:02:13,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:02:13,109 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:02:13,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:02:13,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:02:13,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:02:13,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:02:13,338 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:02:13,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 21:02:13,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 21:02:13,364 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:02:13,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 21:02:13,468 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:02:13,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 21:02:13,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 21:02:13,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:02:13,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 21:02:13,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:02:13,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:13,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-11-02 21:02:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:13,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:02:14,023 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_279 (Array Int Int))) (or (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_69|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (or (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_69|))))) is different from false [2022-11-02 21:02:14,186 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_279 (Array Int Int))) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|) 4)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_69|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_69|))))) is different from false [2022-11-02 21:02:14,231 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (or (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_69|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|) 4)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_69|)))))) is different from false [2022-11-02 21:02:14,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:14,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-02 21:02:14,289 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:14,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:02:14,315 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:14,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2022-11-02 21:02:14,338 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:14,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2022-11-02 21:02:14,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-11-02 21:02:14,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2022-11-02 21:02:14,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:14,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-02 21:02:14,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:02:14,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:02:14,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:02:14,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-02 21:02:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:14,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791640952] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:02:14,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:02:14,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-02 21:02:14,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926416008] [2022-11-02 21:02:14,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:02:14,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 21:02:14,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:14,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 21:02:14,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-11-02 21:02:14,787 INFO L87 Difference]: Start difference. First operand 216 states and 257 transitions. Second operand has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:17,267 INFO L93 Difference]: Finished difference Result 484 states and 558 transitions. [2022-11-02 21:02:17,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-02 21:02:17,268 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 21:02:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:17,270 INFO L225 Difference]: With dead ends: 484 [2022-11-02 21:02:17,270 INFO L226 Difference]: Without dead ends: 484 [2022-11-02 21:02:17,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=412, Invalid=2146, Unknown=4, NotChecked=300, Total=2862 [2022-11-02 21:02:17,272 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 820 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1143 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:17,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1294 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1468 Invalid, 0 Unknown, 1143 Unchecked, 1.2s Time] [2022-11-02 21:02:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-02 21:02:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 216. [2022-11-02 21:02:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 175 states have (on average 1.4628571428571429) internal successors, (256), 215 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 256 transitions. [2022-11-02 21:02:17,284 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 256 transitions. Word has length 27 [2022-11-02 21:02:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:17,286 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 256 transitions. [2022-11-02 21:02:17,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 256 transitions. [2022-11-02 21:02:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 21:02:17,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:17,292 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:02:17,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:02:17,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:02:17,518 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash 24881054, now seen corresponding path program 1 times [2022-11-02 21:02:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:17,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273028365] [2022-11-02 21:02:17,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:17,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:02:17,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:17,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273028365] [2022-11-02 21:02:17,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273028365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:17,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:17,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:02:17,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969730222] [2022-11-02 21:02:17,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:17,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:17,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:17,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:17,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:17,561 INFO L87 Difference]: Start difference. First operand 216 states and 256 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:17,571 INFO L93 Difference]: Finished difference Result 218 states and 258 transitions. [2022-11-02 21:02:17,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:17,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 29 [2022-11-02 21:02:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:17,573 INFO L225 Difference]: With dead ends: 218 [2022-11-02 21:02:17,573 INFO L226 Difference]: Without dead ends: 218 [2022-11-02 21:02:17,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:17,574 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:17,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:02:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-02 21:02:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-11-02 21:02:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 177 states have (on average 1.4576271186440677) internal successors, (258), 217 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2022-11-02 21:02:17,580 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 258 transitions. Word has length 29 [2022-11-02 21:02:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:17,580 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 258 transitions. [2022-11-02 21:02:17,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 258 transitions. [2022-11-02 21:02:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 21:02:17,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:17,582 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:02:17,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:02:17,582 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:17,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:17,583 INFO L85 PathProgramCache]: Analyzing trace with hash -197373836, now seen corresponding path program 1 times [2022-11-02 21:02:17,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:17,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809534606] [2022-11-02 21:02:17,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:17,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:02:17,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:17,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809534606] [2022-11-02 21:02:17,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809534606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:17,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:17,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:02:17,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922143538] [2022-11-02 21:02:17,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:17,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:17,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:17,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:17,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:17,682 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:17,983 INFO L93 Difference]: Finished difference Result 243 states and 288 transitions. [2022-11-02 21:02:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 32 [2022-11-02 21:02:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:17,985 INFO L225 Difference]: With dead ends: 243 [2022-11-02 21:02:17,985 INFO L226 Difference]: Without dead ends: 243 [2022-11-02 21:02:17,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:17,985 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 109 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:17,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 345 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-02 21:02:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2022-11-02 21:02:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.4519774011299436) internal successors, (257), 216 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2022-11-02 21:02:17,990 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 32 [2022-11-02 21:02:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:17,991 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2022-11-02 21:02:17,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2022-11-02 21:02:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 21:02:17,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:17,992 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:02:17,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:02:17,992 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash -197373835, now seen corresponding path program 1 times [2022-11-02 21:02:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:17,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170239549] [2022-11-02 21:02:17,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:18,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:18,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170239549] [2022-11-02 21:02:18,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170239549] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:02:18,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472435611] [2022-11-02 21:02:18,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:18,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:02:18,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:02:18,606 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:02:18,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:02:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-02 21:02:18,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:02:18,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:02:18,813 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:02:18,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:02:18,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:02:18,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:02:18,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 21:02:18,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:02:19,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:02:19,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-02 21:02:19,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:02:19,284 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:19,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 17 [2022-11-02 21:02:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:19,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:02:19,460 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:19,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-02 21:02:19,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_423 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_74|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_74| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-02 21:02:19,748 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_423 (Array Int Int))) (or (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_74|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_74| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-02 21:02:19,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_423 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_74|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_74| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_423) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|)))) is different from false [2022-11-02 21:02:19,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:19,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 21:02:19,796 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:19,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-02 21:02:19,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 21:02:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:20,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472435611] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:02:20,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:02:20,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-11-02 21:02:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230856569] [2022-11-02 21:02:20,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:02:20,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-02 21:02:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:20,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-02 21:02:20,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1260, Unknown=3, NotChecked=222, Total=1640 [2022-11-02 21:02:20,149 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand has 41 states, 40 states have (on average 2.35) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:22,504 INFO L93 Difference]: Finished difference Result 337 states and 389 transitions. [2022-11-02 21:02:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-02 21:02:22,505 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.35) internal successors, (94), 41 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 32 [2022-11-02 21:02:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:22,506 INFO L225 Difference]: With dead ends: 337 [2022-11-02 21:02:22,506 INFO L226 Difference]: Without dead ends: 337 [2022-11-02 21:02:22,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=615, Invalid=3554, Unknown=3, NotChecked=384, Total=4556 [2022-11-02 21:02:22,508 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 449 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 646 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:22,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 2039 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1543 Invalid, 0 Unknown, 646 Unchecked, 1.1s Time] [2022-11-02 21:02:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-11-02 21:02:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 208. [2022-11-02 21:02:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 174 states have (on average 1.4137931034482758) internal successors, (246), 207 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 246 transitions. [2022-11-02 21:02:22,514 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 246 transitions. Word has length 32 [2022-11-02 21:02:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:22,514 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 246 transitions. [2022-11-02 21:02:22,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.35) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 246 transitions. [2022-11-02 21:02:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 21:02:22,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:22,515 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:02:22,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:02:22,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:02:22,729 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:22,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:22,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1018847574, now seen corresponding path program 1 times [2022-11-02 21:02:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:22,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685331992] [2022-11-02 21:02:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:22,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:02:22,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:22,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685331992] [2022-11-02 21:02:22,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685331992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:22,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:22,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:02:22,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419403931] [2022-11-02 21:02:22,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:22,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:02:22,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:22,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:02:22,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:02:22,894 INFO L87 Difference]: Start difference. First operand 208 states and 246 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:23,137 INFO L93 Difference]: Finished difference Result 224 states and 264 transitions. [2022-11-02 21:02:23,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:02:23,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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 32 [2022-11-02 21:02:23,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:23,139 INFO L225 Difference]: With dead ends: 224 [2022-11-02 21:02:23,139 INFO L226 Difference]: Without dead ends: 224 [2022-11-02 21:02:23,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:02:23,140 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 31 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:23,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 547 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-02 21:02:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2022-11-02 21:02:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 215 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2022-11-02 21:02:23,145 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 32 [2022-11-02 21:02:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:23,145 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2022-11-02 21:02:23,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2022-11-02 21:02:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 21:02:23,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:23,146 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:02:23,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:02:23,147 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:23,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1018907156, now seen corresponding path program 1 times [2022-11-02 21:02:23,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:23,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606042497] [2022-11-02 21:02:23,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:23,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:02:23,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:23,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606042497] [2022-11-02 21:02:23,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606042497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:23,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:23,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:02:23,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675457743] [2022-11-02 21:02:23,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:23,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:23,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:23,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:23,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:23,205 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:23,264 INFO L93 Difference]: Finished difference Result 214 states and 249 transitions. [2022-11-02 21:02:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:23,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 32 [2022-11-02 21:02:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:23,266 INFO L225 Difference]: With dead ends: 214 [2022-11-02 21:02:23,266 INFO L226 Difference]: Without dead ends: 214 [2022-11-02 21:02:23,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:23,269 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 67 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:23,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 152 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:02:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-02 21:02:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2022-11-02 21:02:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 212 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2022-11-02 21:02:23,275 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 32 [2022-11-02 21:02:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:23,276 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2022-11-02 21:02:23,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2022-11-02 21:02:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 21:02:23,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:23,277 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:02:23,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:02:23,278 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:23,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1018907157, now seen corresponding path program 1 times [2022-11-02 21:02:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:23,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969688395] [2022-11-02 21:02:23,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:23,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:02:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:23,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969688395] [2022-11-02 21:02:23,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969688395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:23,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:23,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:02:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355352249] [2022-11-02 21:02:23,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:23,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:23,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:23,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:23,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:23,375 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:23,440 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2022-11-02 21:02:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:23,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 32 [2022-11-02 21:02:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:23,442 INFO L225 Difference]: With dead ends: 210 [2022-11-02 21:02:23,443 INFO L226 Difference]: Without dead ends: 210 [2022-11-02 21:02:23,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:23,444 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 72 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:23,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 136 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:02:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-02 21:02:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-11-02 21:02:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 182 states have (on average 1.3406593406593406) internal successors, (244), 209 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2022-11-02 21:02:23,450 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 244 transitions. Word has length 32 [2022-11-02 21:02:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:23,450 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 244 transitions. [2022-11-02 21:02:23,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 244 transitions. [2022-11-02 21:02:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 21:02:23,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:23,451 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:02:23,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:02:23,451 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:23,452 INFO L85 PathProgramCache]: Analyzing trace with hash 948343841, now seen corresponding path program 1 times [2022-11-02 21:02:23,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:23,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955820528] [2022-11-02 21:02:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:23,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:02:23,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:23,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955820528] [2022-11-02 21:02:23,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955820528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:23,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:23,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:02:23,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577704713] [2022-11-02 21:02:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:23,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:23,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:23,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:23,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:23,536 INFO L87 Difference]: Start difference. First operand 210 states and 244 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:23,784 INFO L93 Difference]: Finished difference Result 230 states and 265 transitions. [2022-11-02 21:02:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:23,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 36 [2022-11-02 21:02:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:23,786 INFO L225 Difference]: With dead ends: 230 [2022-11-02 21:02:23,786 INFO L226 Difference]: Without dead ends: 230 [2022-11-02 21:02:23,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:23,787 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 92 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:23,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 321 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-02 21:02:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 216. [2022-11-02 21:02:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 188 states have (on average 1.3457446808510638) internal successors, (253), 215 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 253 transitions. [2022-11-02 21:02:23,792 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 253 transitions. Word has length 36 [2022-11-02 21:02:23,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:23,793 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 253 transitions. [2022-11-02 21:02:23,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 253 transitions. [2022-11-02 21:02:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 21:02:23,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:23,794 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:02:23,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:02:23,794 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash 948343842, now seen corresponding path program 1 times [2022-11-02 21:02:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:23,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601231852] [2022-11-02 21:02:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:24,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:24,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601231852] [2022-11-02 21:02:24,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601231852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:02:24,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219346842] [2022-11-02 21:02:24,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:24,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:02:24,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:02:24,374 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:02:24,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:02:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:24,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 21:02:24,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:02:24,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-02 21:02:24,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 21:02:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:02:24,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:02:24,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219346842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:24,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:02:24,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2022-11-02 21:02:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534527911] [2022-11-02 21:02:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:24,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:24,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:24,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:24,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:02:24,663 INFO L87 Difference]: Start difference. First operand 216 states and 253 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:24,963 INFO L93 Difference]: Finished difference Result 225 states and 260 transitions. [2022-11-02 21:02:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:24,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 36 [2022-11-02 21:02:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:24,965 INFO L225 Difference]: With dead ends: 225 [2022-11-02 21:02:24,965 INFO L226 Difference]: Without dead ends: 225 [2022-11-02 21:02:24,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-11-02 21:02:24,966 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 53 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:24,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 389 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-02 21:02:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2022-11-02 21:02:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 188 states have (on average 1.3191489361702127) internal successors, (248), 213 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 248 transitions. [2022-11-02 21:02:24,989 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 248 transitions. Word has length 36 [2022-11-02 21:02:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:24,989 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 248 transitions. [2022-11-02 21:02:24,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 248 transitions. [2022-11-02 21:02:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 21:02:24,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:24,992 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:02:25,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:02:25,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 21:02:25,193 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-11-02 21:02:25,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:25,194 INFO L85 PathProgramCache]: Analyzing trace with hash -468812102, now seen corresponding path program 1 times [2022-11-02 21:02:25,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:25,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418397165] [2022-11-02 21:02:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:26,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:26,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418397165] [2022-11-02 21:02:26,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418397165] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:02:26,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616207394] [2022-11-02 21:02:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:26,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:02:26,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:02:26,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:02:26,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b1015c-3005-42dd-95fd-4b7a9c511f65/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:02:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-02 21:02:26,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:02:26,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:02:26,246 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:02:26,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:02:26,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:02:26,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:02:26,488 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 21:02:26,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-11-02 21:02:26,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:02:26,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-02 21:02:26,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:02:26,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:02:26,669 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:02:26,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 70 [2022-11-02 21:02:26,686 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-02 21:02:26,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2022-11-02 21:02:27,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:02:27,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:02:27,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:02:27,353 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-02 21:02:27,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 42 [2022-11-02 21:02:27,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:02:27,367 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 21:02:27,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2022-11-02 21:02:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:27,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:02:50,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:02:50,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 32267 treesize of output 29776 [2022-11-02 21:02:52,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:02:55,916 INFO L356 Elim1Store]: treesize reduction 606, result has 56.1 percent of original size [2022-11-02 21:02:55,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 16 new quantified variables, introduced 106 case distinctions, treesize of input 323740 treesize of output 305844 [2022-11-02 21:03:20,720 WARN L234 SmtUtils]: Spent 24.80s on a formula simplification. DAG size of input: 1305 DAG size of output: 1256 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 21:03:22,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:03:22,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 352036 treesize of output 302986 [2022-11-02 21:03:25,158 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:03:25,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-11-02 21:03:29,405 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-11-02 21:03:29,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-11-02 21:03:31,450 INFO L356 Elim1Store]: treesize reduction 62, result has 52.7 percent of original size [2022-11-02 21:03:31,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 155 [2022-11-02 21:03:36,104 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-11-02 21:03:36,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-11-02 21:03:38,465 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-11-02 21:03:38,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-11-02 21:03:40,521 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-11-02 21:03:40,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-11-02 21:03:54,681 WARN L234 SmtUtils]: Spent 7.93s on a formula simplification. DAG size of input: 966 DAG size of output: 966 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)