./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:36:56,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:36:56,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:36:56,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:36:56,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:36:56,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:36:56,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:36:56,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:36:56,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:36:56,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:36:56,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:36:56,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:36:56,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:36:56,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:36:56,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:36:56,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:36:56,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:36:56,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:36:56,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:36:56,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:36:56,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:36:56,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:36:56,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:36:56,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:36:56,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:36:56,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:36:56,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:36:56,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:36:56,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:36:56,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:36:56,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:36:56,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:36:56,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:36:56,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:36:56,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:36:56,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:36:56,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:36:56,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:36:56,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:36:56,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:36:56,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:36:56,678 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-21 00:36:56,723 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:36:56,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:36:56,727 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:36:56,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:36:56,729 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:36:56,729 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:36:56,729 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:36:56,729 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:36:56,730 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:36:56,730 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:36:56,731 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:36:56,731 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:36:56,731 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:36:56,732 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:36:56,732 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:36:56,732 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:36:56,732 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:36:56,733 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:36:56,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 00:36:56,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 00:36:56,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:36:56,734 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:36:56,735 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 00:36:56,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:36:56,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:36:56,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:36:56,737 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 00:36:56,738 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 00:36:56,738 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 00:36:56,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:36:56,738 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 00:36:56,739 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:36:56,739 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:36:56,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:36:56,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:36:56,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:36:56,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:36:56,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:36:56,740 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:36:56,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:36:56,741 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:36:56,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:36:56,741 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/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_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 [2021-11-21 00:36:57,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:36:57,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:36:57,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:36:57,040 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:36:57,041 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:36:57,043 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2021-11-21 00:36:57,139 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/data/428c510a3/d964cb7ce8a8418ab3398a5e69f606a1/FLAG4c3adb2f3 [2021-11-21 00:36:57,707 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:36:57,707 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2021-11-21 00:36:57,722 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/data/428c510a3/d964cb7ce8a8418ab3398a5e69f606a1/FLAG4c3adb2f3 [2021-11-21 00:36:57,991 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/data/428c510a3/d964cb7ce8a8418ab3398a5e69f606a1 [2021-11-21 00:36:57,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:36:57,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:36:58,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:36:58,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:36:58,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:36:58,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:36:57" (1/1) ... [2021-11-21 00:36:58,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2044e300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58, skipping insertion in model container [2021-11-21 00:36:58,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:36:57" (1/1) ... [2021-11-21 00:36:58,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:36:58,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:36:58,416 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_b0bf958c-7d58-4e27-854d-d213e7866734/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2021-11-21 00:36:58,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:36:58,437 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:36:58,518 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_b0bf958c-7d58-4e27-854d-d213e7866734/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2021-11-21 00:36:58,520 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:36:58,557 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:36:58,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58 WrapperNode [2021-11-21 00:36:58,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:36:58,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:36:58,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:36:58,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:36:58,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58" (1/1) ... [2021-11-21 00:36:58,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58" (1/1) ... [2021-11-21 00:36:58,627 INFO L137 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 125 [2021-11-21 00:36:58,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:36:58,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:36:58,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:36:58,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:36:58,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58" (1/1) ... [2021-11-21 00:36:58,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58" (1/1) ... [2021-11-21 00:36:58,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58" (1/1) ... [2021-11-21 00:36:58,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58" (1/1) ... [2021-11-21 00:36:58,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58" (1/1) ... [2021-11-21 00:36:58,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58" (1/1) ... [2021-11-21 00:36:58,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58" (1/1) ... [2021-11-21 00:36:58,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:36:58,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:36:58,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:36:58,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:36:58,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58" (1/1) ... [2021-11-21 00:36:58,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:36:58,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:36:58,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:36:58,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:36:58,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 00:36:58,773 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 00:36:58,773 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 00:36:58,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 00:36:58,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:36:58,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:36:58,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 00:36:58,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 00:36:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:36:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 00:36:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 00:36:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:36:58,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:36:58,896 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:36:58,898 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:36:59,361 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:36:59,417 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:36:59,417 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 00:36:59,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:36:59 BoogieIcfgContainer [2021-11-21 00:36:59,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:36:59,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:36:59,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:36:59,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:36:59,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:36:57" (1/3) ... [2021-11-21 00:36:59,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2f7d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:36:59, skipping insertion in model container [2021-11-21 00:36:59,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:36:58" (2/3) ... [2021-11-21 00:36:59,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2f7d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:36:59, skipping insertion in model container [2021-11-21 00:36:59,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:36:59" (3/3) ... [2021-11-21 00:36:59,447 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2021-11-21 00:36:59,453 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:36:59,454 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-11-21 00:36:59,536 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:36:59,552 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 00:36:59,553 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-11-21 00:36:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:36:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-21 00:36:59,617 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:36:59,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-21 00:36:59,618 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:36:59,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:36:59,625 INFO L85 PathProgramCache]: Analyzing trace with hash 186780823, now seen corresponding path program 1 times [2021-11-21 00:36:59,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:36:59,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475046582] [2021-11-21 00:36:59,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:36:59,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:36:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:36:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:36:59,937 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:36:59,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475046582] [2021-11-21 00:36:59,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475046582] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:36:59,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:36:59,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 00:36:59,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268572758] [2021-11-21 00:36:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:36:59,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:36:59,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:37:00,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:37:00,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:37:00,017 INFO L87 Difference]: Start difference. First operand has 84 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:37:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:37:00,217 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-11-21 00:37:00,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:37:00,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-21 00:37:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:37:00,231 INFO L225 Difference]: With dead ends: 82 [2021-11-21 00:37:00,232 INFO L226 Difference]: Without dead ends: 80 [2021-11-21 00:37:00,234 INFO L932 BasicCegarLoop]: 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 [2021-11-21 00:37:00,242 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:37:00,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 107 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:37:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-21 00:37:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-11-21 00:37:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 37 states have (on average 2.189189189189189) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2021-11-21 00:37:00,299 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 5 [2021-11-21 00:37:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:37:00,300 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2021-11-21 00:37:00,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:37:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2021-11-21 00:37:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-21 00:37:00,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:37:00,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-21 00:37:00,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:37:00,302 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:37:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:37:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash 186780824, now seen corresponding path program 1 times [2021-11-21 00:37:00,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:37:00,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318588205] [2021-11-21 00:37:00,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:00,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:37:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:37:00,371 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:37:00,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318588205] [2021-11-21 00:37:00,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318588205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:37:00,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:37:00,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 00:37:00,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469012663] [2021-11-21 00:37:00,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:37:00,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:37:00,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:37:00,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:37:00,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:37:00,376 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:37:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:37:00,482 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2021-11-21 00:37:00,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:37:00,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-21 00:37:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:37:00,492 INFO L225 Difference]: With dead ends: 78 [2021-11-21 00:37:00,492 INFO L226 Difference]: Without dead ends: 78 [2021-11-21 00:37:00,498 INFO L932 BasicCegarLoop]: 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 [2021-11-21 00:37:00,501 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:37:00,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 112 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:37:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-21 00:37:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-11-21 00:37:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 37 states have (on average 2.135135135135135) internal successors, (79), 74 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2021-11-21 00:37:00,533 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 5 [2021-11-21 00:37:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:37:00,533 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2021-11-21 00:37:00,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:37:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2021-11-21 00:37:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 00:37:00,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:37:00,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:37:00,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 00:37:00,538 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:37:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:37:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash 495704860, now seen corresponding path program 1 times [2021-11-21 00:37:00,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:37:00,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959886043] [2021-11-21 00:37:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:00,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:37:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:37:00,667 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:37:00,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959886043] [2021-11-21 00:37:00,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959886043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:37:00,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:37:00,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 00:37:00,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830803680] [2021-11-21 00:37:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:37:00,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:37:00,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:37:00,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:37:00,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:37:00,671 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:37:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:37:00,735 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2021-11-21 00:37:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:37:00,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-21 00:37:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:37:00,740 INFO L225 Difference]: With dead ends: 84 [2021-11-21 00:37:00,740 INFO L226 Difference]: Without dead ends: 84 [2021-11-21 00:37:00,741 INFO L932 BasicCegarLoop]: 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 [2021-11-21 00:37:00,742 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:37:00,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 139 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:37:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-21 00:37:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2021-11-21 00:37:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 75 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2021-11-21 00:37:00,761 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 10 [2021-11-21 00:37:00,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:37:00,763 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2021-11-21 00:37:00,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:37:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2021-11-21 00:37:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 00:37:00,765 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:37:00,765 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:37:00,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 00:37:00,766 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:37:00,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:37:00,767 INFO L85 PathProgramCache]: Analyzing trace with hash 546432136, now seen corresponding path program 1 times [2021-11-21 00:37:00,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:37:00,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690857401] [2021-11-21 00:37:00,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:00,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:37:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:37:00,941 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:37:00,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690857401] [2021-11-21 00:37:00,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690857401] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:37:00,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:37:00,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 00:37:00,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376596775] [2021-11-21 00:37:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:37:00,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:37:00,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:37:00,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:37:00,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:37:00,943 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:37:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:37:01,180 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2021-11-21 00:37:01,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:37:01,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-21 00:37:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:37:01,189 INFO L225 Difference]: With dead ends: 128 [2021-11-21 00:37:01,189 INFO L226 Difference]: Without dead ends: 128 [2021-11-21 00:37:01,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:37:01,202 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 59 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:37:01,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 189 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 00:37:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-21 00:37:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 78. [2021-11-21 00:37:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 74 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2021-11-21 00:37:01,224 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 17 [2021-11-21 00:37:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:37:01,225 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2021-11-21 00:37:01,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:37:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2021-11-21 00:37:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 00:37:01,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:37:01,227 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:37:01,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 00:37:01,227 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:37:01,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:37:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 546432137, now seen corresponding path program 1 times [2021-11-21 00:37:01,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:37:01,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518847331] [2021-11-21 00:37:01,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:01,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:37:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:37:01,366 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:37:01,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518847331] [2021-11-21 00:37:01,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518847331] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:37:01,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:37:01,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 00:37:01,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297626642] [2021-11-21 00:37:01,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:37:01,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:37:01,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:37:01,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:37:01,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:37:01,374 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:37:01,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:37:01,542 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2021-11-21 00:37:01,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:37:01,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-21 00:37:01,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:37:01,545 INFO L225 Difference]: With dead ends: 78 [2021-11-21 00:37:01,545 INFO L226 Difference]: Without dead ends: 78 [2021-11-21 00:37:01,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:37:01,546 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 71 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:37:01,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 177 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:37:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-21 00:37:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2021-11-21 00:37:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-11-21 00:37:01,568 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 17 [2021-11-21 00:37:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:37:01,568 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-11-21 00:37:01,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:37:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-11-21 00:37:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-21 00:37:01,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:37:01,570 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:37:01,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-21 00:37:01,570 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:37:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:37:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1135423144, now seen corresponding path program 1 times [2021-11-21 00:37:01,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:37:01,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626223847] [2021-11-21 00:37:01,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:01,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:37:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:37:01,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:37:01,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626223847] [2021-11-21 00:37:01,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626223847] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:37:01,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630671583] [2021-11-21 00:37:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:01,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:37:01,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:37:01,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:37:01,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 00:37:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:01,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-21 00:37:01,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:37:01,982 INFO L388 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 [2021-11-21 00:37:02,247 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-21 00:37:02,249 INFO L388 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 [2021-11-21 00:37:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:37:02,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:37:02,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630671583] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:37:02,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [955952014] [2021-11-21 00:37:02,512 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-21 00:37:02,512 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 00:37:02,516 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 00:37:02,522 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 00:37:02,522 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 00:37:02,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:37:02,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:37:02,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-21 00:37:02,722 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 00:37:02,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 00:37:02,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 9 [2021-11-21 00:37:02,790 INFO L388 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 [2021-11-21 00:37:02,818 INFO L388 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 [2021-11-21 00:37:02,831 INFO L388 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 [2021-11-21 00:37:02,842 INFO L388 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 15 treesize of output 1 [2021-11-21 00:37:02,863 INFO L388 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 13 treesize of output 9 [2021-11-21 00:37:02,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:37:02,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-21 00:37:02,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:37:02,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-21 00:37:03,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:37:03,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:37:03,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 00:37:03,129 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 00:37:03,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 00:37:03,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:37:03,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:37:03,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 00:37:03,967 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:37:03,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 00:37:04,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 00:37:04,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:04,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:04,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:04,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:04,243 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:37:04,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 00:37:04,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:04,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:04,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 00:37:04,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:04,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:04,850 INFO L388 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 19 treesize of output 11 [2021-11-21 00:37:04,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:37:04,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:37:04,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-21 00:37:05,218 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:37:05,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 00:37:05,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:05,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:05,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:05,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:05,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 00:37:05,548 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:37:05,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 00:37:05,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:05,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:05,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:05,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:05,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 00:37:06,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-21 00:37:06,113 INFO L388 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 19 treesize of output 11 [2021-11-21 00:37:06,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:37:06,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 00:37:06,450 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:37:06,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 00:37:06,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:06,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 00:37:06,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:06,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:06,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:06,786 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:37:06,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 00:37:06,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:06,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2021-11-21 00:37:06,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:06,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-11-21 00:37:06,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-11-21 00:37:07,331 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:37:07,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 00:37:07,875 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 00:37:07,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 00:37:07,917 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 88 for LOIs [2021-11-21 00:37:10,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:37:10,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-21 00:37:10,236 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Some non-self update cases but no top-level DER relation at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:340) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:278) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-21 00:37:10,240 INFO L158 Benchmark]: Toolchain (without parser) took 12241.60ms. Allocated memory was 134.2MB in the beginning and 184.5MB in the end (delta: 50.3MB). Free memory was 95.9MB in the beginning and 68.5MB in the end (delta: 27.4MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2021-11-21 00:37:10,240 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 81.8MB. Free memory was 34.9MB in the beginning and 34.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:37:10,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.92ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 98.0MB in the end (delta: -2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 00:37:10,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.75ms. Allocated memory is still 134.2MB. Free memory was 98.0MB in the beginning and 95.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:37:10,241 INFO L158 Benchmark]: Boogie Preprocessor took 35.12ms. Allocated memory is still 134.2MB. Free memory was 95.9MB in the beginning and 94.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:37:10,241 INFO L158 Benchmark]: RCFGBuilder took 756.97ms. Allocated memory is still 134.2MB. Free memory was 94.5MB in the beginning and 75.0MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-21 00:37:10,241 INFO L158 Benchmark]: TraceAbstraction took 10816.15ms. Allocated memory was 134.2MB in the beginning and 184.5MB in the end (delta: 50.3MB). Free memory was 74.5MB in the beginning and 68.5MB in the end (delta: 6.0MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2021-11-21 00:37:10,243 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 81.8MB. Free memory was 34.9MB in the beginning and 34.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.92ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 98.0MB in the end (delta: -2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.75ms. Allocated memory is still 134.2MB. Free memory was 98.0MB in the beginning and 95.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.12ms. Allocated memory is still 134.2MB. Free memory was 95.9MB in the beginning and 94.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 756.97ms. Allocated memory is still 134.2MB. Free memory was 94.5MB in the beginning and 75.0MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10816.15ms. Allocated memory was 134.2MB in the beginning and 184.5MB in the end (delta: 50.3MB). Free memory was 74.5MB in the beginning and 68.5MB in the end (delta: 6.0MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Some non-self update cases but no top-level DER relation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Some non-self update cases but no top-level DER relation: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-21 00:37:10,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:37:12,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:37:12,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:37:12,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:37:12,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:37:12,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:37:12,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:37:12,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:37:12,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:37:13,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:37:13,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:37:13,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:37:13,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:37:13,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:37:13,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:37:13,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:37:13,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:37:13,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:37:13,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:37:13,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:37:13,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:37:13,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:37:13,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:37:13,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:37:13,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:37:13,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:37:13,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:37:13,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:37:13,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:37:13,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:37:13,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:37:13,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:37:13,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:37:13,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:37:13,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:37:13,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:37:13,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:37:13,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:37:13,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:37:13,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:37:13,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:37:13,057 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-21 00:37:13,085 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:37:13,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:37:13,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:37:13,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:37:13,091 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:37:13,091 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:37:13,091 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:37:13,092 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:37:13,092 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:37:13,092 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:37:13,093 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:37:13,093 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:37:13,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 00:37:13,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 00:37:13,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:37:13,096 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:37:13,096 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 00:37:13,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:37:13,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:37:13,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:37:13,097 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 00:37:13,097 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 00:37:13,097 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 00:37:13,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:37:13,098 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 00:37:13,098 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 00:37:13,098 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 00:37:13,098 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:37:13,099 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:37:13,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:37:13,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 00:37:13,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:37:13,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:37:13,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:37:13,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:37:13,101 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 00:37:13,101 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 00:37:13,102 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:37:13,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:37:13,102 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/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_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 [2021-11-21 00:37:13,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:37:13,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:37:13,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:37:13,618 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:37:13,619 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:37:13,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2021-11-21 00:37:13,691 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/data/013353b42/5ed96110feac4c739474bf695928dc7e/FLAG2474051a1 [2021-11-21 00:37:14,290 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:37:14,291 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2021-11-21 00:37:14,308 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/data/013353b42/5ed96110feac4c739474bf695928dc7e/FLAG2474051a1 [2021-11-21 00:37:14,700 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/data/013353b42/5ed96110feac4c739474bf695928dc7e [2021-11-21 00:37:14,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:37:14,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:37:14,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:37:14,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:37:14,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:37:14,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:37:14" (1/1) ... [2021-11-21 00:37:14,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a4e5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:14, skipping insertion in model container [2021-11-21 00:37:14,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:37:14" (1/1) ... [2021-11-21 00:37:14,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:37:14,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:37:15,097 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_b0bf958c-7d58-4e27-854d-d213e7866734/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2021-11-21 00:37:15,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:37:15,110 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:37:15,176 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_b0bf958c-7d58-4e27-854d-d213e7866734/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2021-11-21 00:37:15,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:37:15,234 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:37:15,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15 WrapperNode [2021-11-21 00:37:15,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:37:15,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:37:15,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:37:15,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:37:15,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15" (1/1) ... [2021-11-21 00:37:15,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15" (1/1) ... [2021-11-21 00:37:15,330 INFO L137 Inliner]: procedures = 129, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2021-11-21 00:37:15,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:37:15,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:37:15,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:37:15,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:37:15,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15" (1/1) ... [2021-11-21 00:37:15,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15" (1/1) ... [2021-11-21 00:37:15,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15" (1/1) ... [2021-11-21 00:37:15,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15" (1/1) ... [2021-11-21 00:37:15,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15" (1/1) ... [2021-11-21 00:37:15,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15" (1/1) ... [2021-11-21 00:37:15,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15" (1/1) ... [2021-11-21 00:37:15,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:37:15,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:37:15,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:37:15,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:37:15,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15" (1/1) ... [2021-11-21 00:37:15,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:37:15,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:37:15,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:37:15,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:37:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 00:37:15,488 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 00:37:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 00:37:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:37:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:37:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 00:37:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 00:37:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:37:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-21 00:37:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 00:37:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 00:37:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:37:15,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:37:15,606 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:37:15,608 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:37:16,141 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:37:16,150 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:37:16,150 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 00:37:16,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:37:16 BoogieIcfgContainer [2021-11-21 00:37:16,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:37:16,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:37:16,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:37:16,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:37:16,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:37:14" (1/3) ... [2021-11-21 00:37:16,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c0377f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:37:16, skipping insertion in model container [2021-11-21 00:37:16,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:37:15" (2/3) ... [2021-11-21 00:37:16,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c0377f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:37:16, skipping insertion in model container [2021-11-21 00:37:16,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:37:16" (3/3) ... [2021-11-21 00:37:16,172 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2021-11-21 00:37:16,181 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:37:16,181 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-11-21 00:37:16,253 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:37:16,271 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 00:37:16,272 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-11-21 00:37:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 93 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 00:37:16,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:37:16,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 00:37:16,315 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:37:16,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:37:16,321 INFO L85 PathProgramCache]: Analyzing trace with hash 894197909, now seen corresponding path program 1 times [2021-11-21 00:37:16,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:37:16,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946466701] [2021-11-21 00:37:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:16,336 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:37:16,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:37:16,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:37:16,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 00:37:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:16,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 00:37:16,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:37:16,527 INFO L388 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 [2021-11-21 00:37:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:37:16,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:37:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:37:16,607 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:37:16,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946466701] [2021-11-21 00:37:16,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946466701] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:37:16,610 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:37:16,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 00:37:16,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108558346] [2021-11-21 00:37:16,613 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:37:16,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:37:16,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:37:16,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:37:16,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:37:16,665 INFO L87 Difference]: Start difference. First operand has 97 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 93 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:37:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:37:16,885 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2021-11-21 00:37:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:37:16,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 00:37:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:37:16,897 INFO L225 Difference]: With dead ends: 95 [2021-11-21 00:37:16,897 INFO L226 Difference]: Without dead ends: 92 [2021-11-21 00:37:16,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:37:16,903 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:37:16,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 00:37:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-21 00:37:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-11-21 00:37:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 88 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2021-11-21 00:37:16,963 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 6 [2021-11-21 00:37:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:37:16,963 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2021-11-21 00:37:16,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:37:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2021-11-21 00:37:16,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 00:37:16,965 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:37:16,965 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 00:37:16,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:37:17,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:37:17,185 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:37:17,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:37:17,186 INFO L85 PathProgramCache]: Analyzing trace with hash 894197910, now seen corresponding path program 1 times [2021-11-21 00:37:17,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:37:17,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960899383] [2021-11-21 00:37:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:17,188 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:37:17,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:37:17,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:37:17,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 00:37:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:17,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 00:37:17,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:37:17,280 INFO L388 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 [2021-11-21 00:37:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:37:17,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:37:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:37:17,389 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:37:17,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960899383] [2021-11-21 00:37:17,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960899383] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:37:17,390 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:37:17,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-21 00:37:17,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615399612] [2021-11-21 00:37:17,391 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:37:17,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:37:17,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:37:17,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:37:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:37:17,394 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:37:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:37:17,900 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2021-11-21 00:37:17,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:37:17,903 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 00:37:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:37:17,904 INFO L225 Difference]: With dead ends: 90 [2021-11-21 00:37:17,904 INFO L226 Difference]: Without dead ends: 90 [2021-11-21 00:37:17,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:37:17,907 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:37:17,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 201 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-21 00:37:17,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-11-21 00:37:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-11-21 00:37:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 86 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2021-11-21 00:37:17,918 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 6 [2021-11-21 00:37:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:37:17,919 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2021-11-21 00:37:17,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:37:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2021-11-21 00:37:17,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 00:37:17,920 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:37:17,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:37:17,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 00:37:18,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:37:18,135 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:37:18,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:37:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1984336343, now seen corresponding path program 1 times [2021-11-21 00:37:18,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:37:18,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506926566] [2021-11-21 00:37:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:18,138 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:37:18,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:37:18,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:37:18,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 00:37:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:18,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 00:37:18,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:37:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:37:18,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:37:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:37:18,378 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:37:18,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506926566] [2021-11-21 00:37:18,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506926566] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:37:18,379 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:37:18,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 00:37:18,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255296690] [2021-11-21 00:37:18,380 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:37:18,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:37:18,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:37:18,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:37:18,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:37:18,381 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:18,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:37:18,415 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2021-11-21 00:37:18,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:37:18,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2021-11-21 00:37:18,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:37:18,417 INFO L225 Difference]: With dead ends: 97 [2021-11-21 00:37:18,418 INFO L226 Difference]: Without dead ends: 97 [2021-11-21 00:37:18,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:37:18,420 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:37:18,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 182 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:37:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-21 00:37:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2021-11-21 00:37:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.84) internal successors, (92), 87 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2021-11-21 00:37:18,437 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 13 [2021-11-21 00:37:18,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:37:18,437 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2021-11-21 00:37:18,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2021-11-21 00:37:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-21 00:37:18,439 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:37:18,439 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:37:18,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 00:37:18,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:37:18,644 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:37:18,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:37:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash 305697820, now seen corresponding path program 1 times [2021-11-21 00:37:18,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:37:18,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61539650] [2021-11-21 00:37:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:18,647 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:37:18,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:37:18,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:37:18,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 00:37:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:18,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:37:18,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:37:18,774 INFO L388 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 [2021-11-21 00:37:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:37:18,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:37:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:37:18,984 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:37:18,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61539650] [2021-11-21 00:37:18,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61539650] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:37:18,991 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:37:18,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-21 00:37:18,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90155439] [2021-11-21 00:37:18,992 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:37:18,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:37:18,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:37:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:37:18,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:37:18,994 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:37:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:37:19,484 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2021-11-21 00:37:19,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:37:19,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-11-21 00:37:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:37:19,488 INFO L225 Difference]: With dead ends: 144 [2021-11-21 00:37:19,488 INFO L226 Difference]: Without dead ends: 144 [2021-11-21 00:37:19,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:37:19,490 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 66 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:37:19,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 247 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-21 00:37:19,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-21 00:37:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 90. [2021-11-21 00:37:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 1.82) internal successors, (91), 86 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2021-11-21 00:37:19,501 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 22 [2021-11-21 00:37:19,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:37:19,502 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2021-11-21 00:37:19,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:37:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2021-11-21 00:37:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-21 00:37:19,503 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:37:19,503 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:37:19,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 00:37:19,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:37:19,715 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:37:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:37:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash 305697821, now seen corresponding path program 1 times [2021-11-21 00:37:19,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:37:19,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402701078] [2021-11-21 00:37:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:19,717 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:37:19,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:37:19,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:37:19,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-21 00:37:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:19,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 00:37:19,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:37:19,859 INFO L388 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 [2021-11-21 00:37:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:37:20,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:37:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:37:20,418 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:37:20,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402701078] [2021-11-21 00:37:20,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402701078] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:37:20,418 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:37:20,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-21 00:37:20,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591520131] [2021-11-21 00:37:20,419 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:37:20,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 00:37:20,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:37:20,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 00:37:20,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-21 00:37:20,421 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 00:37:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:37:21,318 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2021-11-21 00:37:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:37:21,319 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2021-11-21 00:37:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:37:21,321 INFO L225 Difference]: With dead ends: 90 [2021-11-21 00:37:21,321 INFO L226 Difference]: Without dead ends: 90 [2021-11-21 00:37:21,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-21 00:37:21,322 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 81 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:37:21,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 391 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-21 00:37:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-11-21 00:37:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2021-11-21 00:37:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.8) internal successors, (90), 85 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:37:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2021-11-21 00:37:21,331 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 22 [2021-11-21 00:37:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:37:21,331 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2021-11-21 00:37:21,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 00:37:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2021-11-21 00:37:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:37:21,333 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:37:21,333 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:37:21,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-21 00:37:21,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:37:21,550 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:37:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:37:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1713076933, now seen corresponding path program 1 times [2021-11-21 00:37:21,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:37:21,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518170585] [2021-11-21 00:37:21,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:21,553 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:37:21,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:37:21,554 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:37:21,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-21 00:37:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:21,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-21 00:37:21,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:37:21,701 INFO L388 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 [2021-11-21 00:37:21,974 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 00:37:21,975 INFO L388 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 23 treesize of output 30 [2021-11-21 00:37:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:37:22,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:37:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:37:56,288 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:37:56,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518170585] [2021-11-21 00:37:56,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518170585] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:37:56,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1236522961] [2021-11-21 00:37:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:37:56,289 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:37:56,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:37:56,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:37:56,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-21 00:37:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:37:56,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-21 00:37:56,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:37:56,486 INFO L388 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 [2021-11-21 00:38:00,644 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-21 00:38:00,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 21 [2021-11-21 00:38:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:38:00,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:38:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:38:09,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1236522961] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 00:38:09,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:38:09,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 8, 6] total 18 [2021-11-21 00:38:09,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071447713] [2021-11-21 00:38:09,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:38:09,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 00:38:09,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:38:09,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 00:38:09,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=267, Unknown=16, NotChecked=0, Total=342 [2021-11-21 00:38:09,158 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:38:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:38:11,711 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2021-11-21 00:38:11,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 00:38:11,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-11-21 00:38:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:38:11,713 INFO L225 Difference]: With dead ends: 141 [2021-11-21 00:38:11,713 INFO L226 Difference]: Without dead ends: 141 [2021-11-21 00:38:11,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 47.9s TimeCoverageRelationStatistics Valid=69, Invalid=294, Unknown=17, NotChecked=0, Total=380 [2021-11-21 00:38:11,715 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 62 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:38:11,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 353 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 298 Invalid, 0 Unknown, 27 Unchecked, 0.5s Time] [2021-11-21 00:38:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-21 00:38:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2021-11-21 00:38:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.78) internal successors, (89), 84 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:38:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2021-11-21 00:38:11,745 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 25 [2021-11-21 00:38:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:38:11,746 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2021-11-21 00:38:11,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:38:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2021-11-21 00:38:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 00:38:11,747 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:38:11,748 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:38:11,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-21 00:38:11,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-21 00:38:12,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:38:12,150 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:38:12,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:38:12,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1713076934, now seen corresponding path program 1 times [2021-11-21 00:38:12,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:38:12,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761266841] [2021-11-21 00:38:12,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:38:12,151 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:38:12,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:38:12,152 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:38:12,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-21 00:38:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:38:12,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 00:38:12,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:38:12,284 INFO L388 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 [2021-11-21 00:38:12,291 INFO L388 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 [2021-11-21 00:38:12,600 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:38:12,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 28 [2021-11-21 00:38:12,614 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:38:12,615 INFO L388 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 25 treesize of output 25 [2021-11-21 00:38:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:38:12,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:38:17,605 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) is different from true [2021-11-21 00:38:22,060 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) is different from false [2021-11-21 00:38:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-21 00:38:23,414 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:38:23,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761266841] [2021-11-21 00:38:23,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761266841] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:38:23,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1321324595] [2021-11-21 00:38:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:38:23,416 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:38:23,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:38:23,420 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:38:23,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-21 00:38:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:38:23,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 00:38:23,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:38:23,609 INFO L388 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 [2021-11-21 00:38:23,618 INFO L388 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 [2021-11-21 00:38:23,913 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:38:23,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 30 [2021-11-21 00:38:23,929 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:38:23,929 INFO L388 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 27 treesize of output 27 [2021-11-21 00:38:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:38:24,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:38:35,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) is different from false [2021-11-21 00:38:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:38:36,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1321324595] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:38:36,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163213576] [2021-11-21 00:38:36,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:38:36,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:38:36,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:38:36,100 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:38:36,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-21 00:38:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:38:36,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 00:38:36,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:38:36,206 INFO L388 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 [2021-11-21 00:38:36,214 INFO L388 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 [2021-11-21 00:38:36,470 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:38:36,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 34 [2021-11-21 00:38:36,487 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:38:36,487 INFO L388 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 31 treesize of output 31 [2021-11-21 00:38:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:38:36,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:38:50,570 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse1)) (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))))) is different from false [2021-11-21 00:38:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:38:51,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163213576] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:38:51,111 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 00:38:51,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 19 [2021-11-21 00:38:51,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882024271] [2021-11-21 00:38:51,112 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 00:38:51,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-21 00:38:51,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:38:51,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-21 00:38:51,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=201, Unknown=8, NotChecked=124, Total=380 [2021-11-21 00:38:51,114 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-21 00:38:53,270 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) (= |c_#length| |c_old(#length)|) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))))))))) is different from false [2021-11-21 00:38:55,294 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_node_create_~temp~0#1.base|)) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|)))) is different from false [2021-11-21 00:38:57,310 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (= |c_node_create_#res#1.offset| (_ bv0 32)) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|))) (= (_ bv8 32) (select |c_#length| |c_node_create_#res#1.base|))) is different from false [2021-11-21 00:38:59,324 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))))))))) is different from false [2021-11-21 00:39:01,354 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_node_create_~temp~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse2) (bvule .cse2 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse3)) (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))))))))) is different from false [2021-11-21 00:39:03,418 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (= |c_node_create_#res#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse2) (bvule .cse2 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse3)) (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))))) (= (_ bv8 32) (select |c_#length| |c_node_create_#res#1.base|))) is different from false [2021-11-21 00:39:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:39:03,698 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2021-11-21 00:39:03,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-21 00:39:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2021-11-21 00:39:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:39:03,700 INFO L225 Difference]: With dead ends: 115 [2021-11-21 00:39:03,700 INFO L226 Difference]: Without dead ends: 115 [2021-11-21 00:39:03,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=73, Invalid=259, Unknown=14, NotChecked=410, Total=756 [2021-11-21 00:39:03,702 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 6 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 564 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:39:03,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 507 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 564 Unchecked, 0.3s Time] [2021-11-21 00:39:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-21 00:39:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2021-11-21 00:39:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 105 states have internal predecessors, (112), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 00:39:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-11-21 00:39:03,711 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 25 [2021-11-21 00:39:03,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:39:03,711 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-11-21 00:39:03,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-21 00:39:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-11-21 00:39:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-21 00:39:03,713 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:39:03,713 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:39:03,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-21 00:39:03,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-21 00:39:04,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-21 00:39:04,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:39:04,316 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:39:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:39:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1566263260, now seen corresponding path program 1 times [2021-11-21 00:39:04,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:39:04,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218236132] [2021-11-21 00:39:04,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:39:04,317 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:39:04,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:39:04,322 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:39:04,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-21 00:39:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:39:04,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 00:39:04,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:39:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-21 00:39:04,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:39:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-21 00:39:04,626 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:39:04,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218236132] [2021-11-21 00:39:04,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218236132] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:39:04,628 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:39:04,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-21 00:39:04,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915600392] [2021-11-21 00:39:04,628 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:39:04,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:39:04,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:39:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:39:04,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:39:04,630 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-21 00:39:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:39:04,695 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2021-11-21 00:39:04,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 00:39:04,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2021-11-21 00:39:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:39:04,698 INFO L225 Difference]: With dead ends: 173 [2021-11-21 00:39:04,698 INFO L226 Difference]: Without dead ends: 173 [2021-11-21 00:39:04,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:39:04,699 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 388 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:39:04,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 199 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:39:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-21 00:39:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 143. [2021-11-21 00:39:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 101 states have (on average 1.7326732673267327) internal successors, (175), 135 states have internal predecessors, (175), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 00:39:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2021-11-21 00:39:04,713 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 29 [2021-11-21 00:39:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:39:04,713 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2021-11-21 00:39:04,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-21 00:39:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2021-11-21 00:39:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-21 00:39:04,715 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:39:04,715 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:39:04,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-21 00:39:04,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:39:04,930 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-21 00:39:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:39:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1566263288, now seen corresponding path program 1 times [2021-11-21 00:39:04,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:39:04,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250525406] [2021-11-21 00:39:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:39:04,932 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:39:04,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:39:04,933 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:39:04,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-21 00:39:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:39:05,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-21 00:39:05,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:39:05,086 INFO L388 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 [2021-11-21 00:39:05,192 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-21 00:39:05,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 21 [2021-11-21 00:39:05,417 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 00:39:05,418 INFO L388 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 3 case distinctions, treesize of input 34 treesize of output 45 [2021-11-21 00:39:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-21 00:39:05,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:39:09,771 WARN L228 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-11-21 00:39:09,772 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:39:09,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250525406] [2021-11-21 00:39:09,773 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-11-21 00:39:09,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1080078707] [2021-11-21 00:39:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:39:09,773 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:39:09,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:39:09,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-11-21 00:39:09,775 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:39:09,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2021-11-21 00:39:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:39:10,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-21 00:39:10,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:39:10,040 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken [2021-11-21 00:39:10,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397348894] [2021-11-21 00:39:10,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:39:10,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:39:10,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:39:10,047 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:39:10,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-21 00:39:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:39:10,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-21 00:39:10,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:39:10,135 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken [2021-11-21 00:39:10,135 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:39:10,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-21 00:39:10,136 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-11-21 00:39:10,136 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-21 00:39:10,142 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (41 of 42 remaining) [2021-11-21 00:39:10,144 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (40 of 42 remaining) [2021-11-21 00:39:10,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (39 of 42 remaining) [2021-11-21 00:39:10,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (38 of 42 remaining) [2021-11-21 00:39:10,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (37 of 42 remaining) [2021-11-21 00:39:10,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (36 of 42 remaining) [2021-11-21 00:39:10,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (35 of 42 remaining) [2021-11-21 00:39:10,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (34 of 42 remaining) [2021-11-21 00:39:10,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (33 of 42 remaining) [2021-11-21 00:39:10,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (32 of 42 remaining) [2021-11-21 00:39:10,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (31 of 42 remaining) [2021-11-21 00:39:10,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (30 of 42 remaining) [2021-11-21 00:39:10,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (29 of 42 remaining) [2021-11-21 00:39:10,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (28 of 42 remaining) [2021-11-21 00:39:10,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (27 of 42 remaining) [2021-11-21 00:39:10,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (26 of 42 remaining) [2021-11-21 00:39:10,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (25 of 42 remaining) [2021-11-21 00:39:10,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (24 of 42 remaining) [2021-11-21 00:39:10,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (23 of 42 remaining) [2021-11-21 00:39:10,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (22 of 42 remaining) [2021-11-21 00:39:10,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (21 of 42 remaining) [2021-11-21 00:39:10,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (20 of 42 remaining) [2021-11-21 00:39:10,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (19 of 42 remaining) [2021-11-21 00:39:10,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (18 of 42 remaining) [2021-11-21 00:39:10,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (17 of 42 remaining) [2021-11-21 00:39:10,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (16 of 42 remaining) [2021-11-21 00:39:10,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (15 of 42 remaining) [2021-11-21 00:39:10,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE (14 of 42 remaining) [2021-11-21 00:39:10,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE (13 of 42 remaining) [2021-11-21 00:39:10,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE (12 of 42 remaining) [2021-11-21 00:39:10,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (11 of 42 remaining) [2021-11-21 00:39:10,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (10 of 42 remaining) [2021-11-21 00:39:10,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (9 of 42 remaining) [2021-11-21 00:39:10,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (8 of 42 remaining) [2021-11-21 00:39:10,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (7 of 42 remaining) [2021-11-21 00:39:10,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (6 of 42 remaining) [2021-11-21 00:39:10,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (5 of 42 remaining) [2021-11-21 00:39:10,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (4 of 42 remaining) [2021-11-21 00:39:10,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location node_createErr0REQUIRES_VIOLATION (3 of 42 remaining) [2021-11-21 00:39:10,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location node_createErr1REQUIRES_VIOLATION (2 of 42 remaining) [2021-11-21 00:39:10,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location node_createErr2REQUIRES_VIOLATION (1 of 42 remaining) [2021-11-21 00:39:10,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location node_createErr3REQUIRES_VIOLATION (0 of 42 remaining) [2021-11-21 00:39:10,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2021-11-21 00:39:10,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-21 00:39:10,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-11-21 00:39:10,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0bf958c-7d58-4e27-854d-d213e7866734/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:39:10,760 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:39:10,763 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 00:39:10,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 12:39:10 BoogieIcfgContainer [2021-11-21 00:39:10,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 00:39:10,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 00:39:10,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 00:39:10,776 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 00:39:10,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:37:16" (3/4) ... [2021-11-21 00:39:10,778 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-21 00:39:10,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 00:39:10,779 INFO L158 Benchmark]: Toolchain (without parser) took 116074.03ms. Allocated memory was 81.8MB in the beginning and 102.8MB in the end (delta: 21.0MB). Free memory was 63.6MB in the beginning and 26.1MB in the end (delta: 37.5MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2021-11-21 00:39:10,779 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 81.8MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:39:10,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.94ms. Allocated memory is still 81.8MB. Free memory was 63.4MB in the beginning and 56.4MB in the end (delta: 7.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 00:39:10,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.90ms. Allocated memory is still 81.8MB. Free memory was 56.2MB in the beginning and 54.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:39:10,780 INFO L158 Benchmark]: Boogie Preprocessor took 67.18ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 52.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:39:10,781 INFO L158 Benchmark]: RCFGBuilder took 760.31ms. Allocated memory is still 81.8MB. Free memory was 52.1MB in the beginning and 59.4MB in the end (delta: -7.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2021-11-21 00:39:10,781 INFO L158 Benchmark]: TraceAbstraction took 114613.31ms. Allocated memory was 81.8MB in the beginning and 102.8MB in the end (delta: 21.0MB). Free memory was 59.1MB in the beginning and 27.1MB in the end (delta: 32.0MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2021-11-21 00:39:10,781 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 102.8MB. Free memory was 27.1MB in the beginning and 26.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:39:10,783 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.79ms. Allocated memory is still 81.8MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.94ms. Allocated memory is still 81.8MB. Free memory was 63.4MB in the beginning and 56.4MB in the end (delta: 7.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.90ms. Allocated memory is still 81.8MB. Free memory was 56.2MB in the beginning and 54.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.18ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 52.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 760.31ms. Allocated memory is still 81.8MB. Free memory was 52.1MB in the beginning and 59.4MB in the end (delta: -7.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 114613.31ms. Allocated memory was 81.8MB in the beginning and 102.8MB in the end (delta: 21.0MB). Free memory was 59.1MB in the beginning and 27.1MB in the end (delta: 32.0MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 102.8MB. Free memory was 27.1MB in the beginning and 26.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 596]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L613] const int len = 2; [L614] const int data = 1; [L615] SLL s = sll_circular_create(len, data); [L615] CALL, EXPR sll_circular_create(len, data) [L584] CALL, EXPR node_create(data) [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L584] RET, EXPR node_create(data) [L584] SLL head = node_create(data); [L585] SLL last = head; [L586] COND TRUE len > 1 [L587] CALL, EXPR node_create(data) [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L587] RET, EXPR node_create(data) [L587] SLL new_head = node_create(data); [L588] new_head->next = head [L589] head = new_head [L590] len-- [L586] COND FALSE !(len > 1) [L592] last->next = head [L593] return head; [L615] RET, EXPR sll_circular_create(len, data) [L615] SLL s = sll_circular_create(len, data); [L616] int i; [L617] i = 0 [L617] COND TRUE i < len [L618] CALL sll_circular_remove_last(&s) [L596] \read(*head) - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 596]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 597]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 597]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 597]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 597]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 42 error locations. Started 1 CEGAR loops. OverallTime: 114.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 631 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 629 mSDsluCounter, 2224 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 591 IncrementalHoareTripleChecker+Unchecked, 1591 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1051 IncrementalHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 633 mSDtfsCounter, 1051 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 356 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 88.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=8, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 146 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 92.1s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 452 ConstructedInterpolants, 130 QuantifiedInterpolants, 5125 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1259 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 66/132 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN