./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:19:09,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:19:09,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:19:09,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:19:09,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:19:09,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:19:09,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:19:09,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:19:09,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:19:09,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:19:09,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:19:09,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:19:09,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:19:09,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:19:09,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:19:09,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:19:09,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:19:09,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:19:09,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:19:09,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:19:09,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:19:09,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:19:09,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:19:09,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:19:09,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:19:09,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:19:09,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:19:09,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:19:09,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:19:09,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:19:09,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:19:09,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:19:09,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:19:09,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:19:09,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:19:09,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:19:09,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:19:09,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:19:09,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:19:09,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:19:09,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:19:09,484 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-21 00:19:09,541 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:19:09,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:19:09,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:19:09,543 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:19:09,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:19:09,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:19:09,544 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:19:09,544 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:19:09,545 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:19:09,545 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:19:09,546 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:19:09,546 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:19:09,546 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:19:09,547 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:19:09,547 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:19:09,547 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:19:09,547 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:19:09,548 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:19:09,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 00:19:09,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 00:19:09,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:19:09,550 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:19:09,550 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 00:19:09,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:19:09,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:19:09,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:19:09,552 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 00:19:09,552 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 00:19:09,553 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 00:19:09,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:19:09,553 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 00:19:09,554 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:19:09,554 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:19:09,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:19:09,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:19:09,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:19:09,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:19:09,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:19:09,555 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:19:09,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:19:09,556 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:19:09,556 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:19:09,556 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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2021-11-21 00:19:09,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:19:09,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:19:09,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:19:09,953 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:19:09,954 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:19:09,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-11-21 00:19:10,049 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/data/ee56f0455/fab9470a6a204fbba7ecf0f4c86a022e/FLAGe95819105 [2021-11-21 00:19:10,609 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:19:10,610 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-11-21 00:19:10,628 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/data/ee56f0455/fab9470a6a204fbba7ecf0f4c86a022e/FLAGe95819105 [2021-11-21 00:19:10,892 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/data/ee56f0455/fab9470a6a204fbba7ecf0f4c86a022e [2021-11-21 00:19:10,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:19:10,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:19:10,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:19:10,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:19:10,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:19:10,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:19:10" (1/1) ... [2021-11-21 00:19:10,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634256e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:10, skipping insertion in model container [2021-11-21 00:19:10,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:19:10" (1/1) ... [2021-11-21 00:19:10,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:19:10,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:19:11,322 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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2021-11-21 00:19:11,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:19:11,343 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:19:11,428 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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2021-11-21 00:19:11,440 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:19:11,477 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:19:11,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:11 WrapperNode [2021-11-21 00:19:11,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:19:11,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:19:11,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:19:11,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:19:11,488 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:19:11" (1/1) ... [2021-11-21 00:19:11,502 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:19:11" (1/1) ... [2021-11-21 00:19:11,530 INFO L137 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2021-11-21 00:19:11,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:19:11,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:19:11,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:19:11,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:19:11,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:11" (1/1) ... [2021-11-21 00:19:11,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:11" (1/1) ... [2021-11-21 00:19:11,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:11" (1/1) ... [2021-11-21 00:19:11,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:11" (1/1) ... [2021-11-21 00:19:11,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:11" (1/1) ... [2021-11-21 00:19:11,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:11" (1/1) ... [2021-11-21 00:19:11,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:11" (1/1) ... [2021-11-21 00:19:11,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:19:11,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:19:11,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:19:11,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:19:11,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:11" (1/1) ... [2021-11-21 00:19:11,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:19:11,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:19:11,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:19:11,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:19:11,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 00:19:11,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 00:19:11,660 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 00:19:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 00:19:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 00:19:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:19:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:19:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 00:19:11,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 00:19:11,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:19:11,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 00:19:11,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 00:19:11,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:19:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:19:11,811 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:19:11,813 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:19:12,195 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:19:12,263 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:19:12,263 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 00:19:12,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:19:12 BoogieIcfgContainer [2021-11-21 00:19:12,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:19:12,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:19:12,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:19:12,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:19:12,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:19:10" (1/3) ... [2021-11-21 00:19:12,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2561d743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:19:12, skipping insertion in model container [2021-11-21 00:19:12,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:11" (2/3) ... [2021-11-21 00:19:12,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2561d743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:19:12, skipping insertion in model container [2021-11-21 00:19:12,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:19:12" (3/3) ... [2021-11-21 00:19:12,277 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2021-11-21 00:19:12,282 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:19:12,282 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2021-11-21 00:19:12,323 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:19:12,330 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:19:12,331 INFO L340 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2021-11-21 00:19:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 33 states have (on average 2.272727272727273) internal successors, (75), 66 states have internal predecessors, (75), 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:19:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 00:19:12,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:12,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 00:19:12,355 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:12,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1129778367, now seen corresponding path program 1 times [2021-11-21 00:19:12,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:19:12,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99988257] [2021-11-21 00:19:12,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:12,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:19:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:12,550 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:19:12,551 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:19:12,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99988257] [2021-11-21 00:19:12,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99988257] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:19:12,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:19:12,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 00:19:12,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282644940] [2021-11-21 00:19:12,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:19:12,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:19:12,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:19:12,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:19:12,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:19:12,590 INFO L87 Difference]: Start difference. First operand has 70 states, 33 states have (on average 2.272727272727273) internal successors, (75), 66 states have internal predecessors, (75), 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:19:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:19:12,686 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2021-11-21 00:19:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:19:12,689 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:19:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:19:12,699 INFO L225 Difference]: With dead ends: 68 [2021-11-21 00:19:12,699 INFO L226 Difference]: Without dead ends: 66 [2021-11-21 00:19:12,701 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:19:12,705 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:19:12,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 90 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:19:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-21 00:19:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-11-21 00:19:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 32 states have (on average 2.125) internal successors, (68), 62 states have internal predecessors, (68), 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:19:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2021-11-21 00:19:12,744 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 6 [2021-11-21 00:19:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:19:12,744 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2021-11-21 00:19:12,745 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:19:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2021-11-21 00:19:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 00:19:12,746 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:12,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 00:19:12,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:19:12,746 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1129778368, now seen corresponding path program 1 times [2021-11-21 00:19:12,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:19:12,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139221088] [2021-11-21 00:19:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:12,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:19:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:12,806 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:19:12,806 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:19:12,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139221088] [2021-11-21 00:19:12,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139221088] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:19:12,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:19:12,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 00:19:12,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409950801] [2021-11-21 00:19:12,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:19:12,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:19:12,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:19:12,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:19:12,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:19:12,810 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. 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:19:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:19:12,898 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-11-21 00:19:12,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:19:12,902 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:19:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:19:12,903 INFO L225 Difference]: With dead ends: 64 [2021-11-21 00:19:12,903 INFO L226 Difference]: Without dead ends: 64 [2021-11-21 00:19:12,904 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:19:12,906 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:19:12,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:19:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-21 00:19:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-11-21 00:19:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 2.0625) internal successors, (66), 60 states have internal predecessors, (66), 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:19:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-11-21 00:19:12,915 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 6 [2021-11-21 00:19:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:19:12,916 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-11-21 00:19:12,916 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:19:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-11-21 00:19:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 00:19:12,917 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:12,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:19:12,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 00:19:12,918 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1940859804, now seen corresponding path program 1 times [2021-11-21 00:19:12,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:19:12,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203866353] [2021-11-21 00:19:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:12,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:19:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:12,991 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:19:12,991 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:19:12,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203866353] [2021-11-21 00:19:12,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203866353] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:19:12,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:19:12,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 00:19:12,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684464884] [2021-11-21 00:19:12,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:19:12,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:19:12,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:19:12,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:19:12,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:19:12,994 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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:19:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:19:13,143 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2021-11-21 00:19:13,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:19:13,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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:19:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:19:13,146 INFO L225 Difference]: With dead ends: 66 [2021-11-21 00:19:13,146 INFO L226 Difference]: Without dead ends: 66 [2021-11-21 00:19:13,147 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:19:13,148 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:19:13,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 185 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:19:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-21 00:19:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2021-11-21 00:19:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 32 states have (on average 2.03125) internal successors, (65), 59 states have internal predecessors, (65), 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:19:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-11-21 00:19:13,159 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 10 [2021-11-21 00:19:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:19:13,159 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-11-21 00:19:13,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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:19:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-11-21 00:19:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 00:19:13,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:13,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:19:13,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 00:19:13,161 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1940859805, now seen corresponding path program 1 times [2021-11-21 00:19:13,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:19:13,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102183585] [2021-11-21 00:19:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:13,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:19:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:13,344 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:19:13,344 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:19:13,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102183585] [2021-11-21 00:19:13,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102183585] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:19:13,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:19:13,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 00:19:13,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133147228] [2021-11-21 00:19:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:19:13,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:19:13,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:19:13,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:19:13,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:19:13,347 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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:19:13,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:19:13,524 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2021-11-21 00:19:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:19:13,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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:19:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:19:13,529 INFO L225 Difference]: With dead ends: 65 [2021-11-21 00:19:13,529 INFO L226 Difference]: Without dead ends: 65 [2021-11-21 00:19:13,530 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:19:13,540 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:19:13,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 197 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 00:19:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-21 00:19:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2021-11-21 00:19:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 32 states have (on average 2.0) internal successors, (64), 58 states have internal predecessors, (64), 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:19:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-11-21 00:19:13,547 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 10 [2021-11-21 00:19:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:19:13,548 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-11-21 00:19:13,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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:19:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-11-21 00:19:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 00:19:13,549 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:13,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:19:13,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 00:19:13,552 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:13,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash -298389700, now seen corresponding path program 1 times [2021-11-21 00:19:13,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:19:13,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778611803] [2021-11-21 00:19:13,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:13,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:19:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:13,617 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:19:13,618 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:19:13,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778611803] [2021-11-21 00:19:13,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778611803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:19:13,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:19:13,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 00:19:13,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645257455] [2021-11-21 00:19:13,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:19:13,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:19:13,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:19:13,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:19:13,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:19:13,623 INFO L87 Difference]: Start difference. First operand 62 states and 68 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:19:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:19:13,651 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-11-21 00:19:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:19:13,652 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:19:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:19:13,654 INFO L225 Difference]: With dead ends: 66 [2021-11-21 00:19:13,654 INFO L226 Difference]: Without dead ends: 66 [2021-11-21 00:19:13,655 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:19:13,662 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 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:19:13,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:19:13,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-21 00:19:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2021-11-21 00:19:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 59 states have internal predecessors, (65), 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:19:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-11-21 00:19:13,674 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 10 [2021-11-21 00:19:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:19:13,674 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-11-21 00:19:13,674 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:19:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-11-21 00:19:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-21 00:19:13,675 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:13,675 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:19:13,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-21 00:19:13,676 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1310491658, now seen corresponding path program 1 times [2021-11-21 00:19:13,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:19:13,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871374601] [2021-11-21 00:19:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:13,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:19:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 00:19:13,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:19:13,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871374601] [2021-11-21 00:19:13,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871374601] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:19:13,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398247627] [2021-11-21 00:19:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:13,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:19:13,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:19:13,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:19:13,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 00:19:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:13,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:19:13,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:19:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:19:13,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:19:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 00:19:14,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398247627] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:19:14,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [673830191] [2021-11-21 00:19:14,026 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-21 00:19:14,026 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 00:19:14,031 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 00:19:14,044 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 00:19:14,045 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 00:19:14,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:19:14,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:19:14,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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:19:14,435 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 00:19:14,435 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:19:14,511 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:19:14,521 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:19:14,566 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:19:14,579 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:19:14,590 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 19 treesize of output 1 [2021-11-21 00:19:14,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:19:14,638 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 25 treesize of output 13 [2021-11-21 00:19:14,653 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:19:14,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:19:14,665 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 25 treesize of output 13 [2021-11-21 00:19:14,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:19:14,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:19:14,764 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:19:14,949 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 00:19:14,949 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:19:15,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:19:15,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:19:15,098 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:19:15,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:19:15,392 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 21 treesize of output 13 [2021-11-21 00:19:15,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:19:15,409 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 21 treesize of output 13 [2021-11-21 00:19:15,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:19:15,428 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:19:15,718 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:19:15,719 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:19:15,773 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:19:15,798 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:19:15,816 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:19:15,894 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:19:15,906 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:19:15,962 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:19:15,963 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:19:16,040 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:19:16,094 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:19:16,107 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:19:16,119 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:19:16,191 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:19:16,729 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-21 00:19:16,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 209 [2021-11-21 00:19:16,746 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 00:19:16,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 198 [2021-11-21 00:19:16,765 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 00:19:16,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 195 [2021-11-21 00:19:17,287 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:19:17,287 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:19:17,377 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:19:17,393 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:19:17,505 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:19:17,521 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:19:17,535 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:19:17,648 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:19:17,648 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:19:17,691 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:19:17,709 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:19:17,824 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:19:17,870 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:19:17,910 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:19:18,424 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-21 00:19:18,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 209 [2021-11-21 00:19:18,440 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 00:19:18,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 198 [2021-11-21 00:19:18,457 INFO L354 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2021-11-21 00:19:18,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 189 [2021-11-21 00:19:19,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:19:19,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:19:19,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:19:19,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 00:19:20,530 INFO L354 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2021-11-21 00:19:20,530 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 360 treesize of output 365 [2021-11-21 00:19:22,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:19:22,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:19:22,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-21 00:19:22,764 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 101 for LOIs [2021-11-21 00:19:29,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:19:29,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:19:29,850 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:19:29,856 INFO L158 Benchmark]: Toolchain (without parser) took 18959.74ms. Allocated memory was 83.9MB in the beginning and 146.8MB in the end (delta: 62.9MB). Free memory was 46.6MB in the beginning and 45.1MB in the end (delta: 1.5MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2021-11-21 00:19:29,856 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory was 64.0MB in the beginning and 64.0MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:19:29,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.11ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 46.3MB in the beginning and 69.8MB in the end (delta: -23.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-21 00:19:29,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.18ms. Allocated memory is still 100.7MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:19:29,867 INFO L158 Benchmark]: Boogie Preprocessor took 39.30ms. Allocated memory is still 100.7MB. Free memory was 67.7MB in the beginning and 65.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:19:29,867 INFO L158 Benchmark]: RCFGBuilder took 694.82ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 46.8MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-21 00:19:29,867 INFO L158 Benchmark]: TraceAbstraction took 17587.98ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 46.1MB in the beginning and 45.1MB in the end (delta: 1.0MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2021-11-21 00:19:29,870 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.23ms. Allocated memory is still 83.9MB. Free memory was 64.0MB in the beginning and 64.0MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.11ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 46.3MB in the beginning and 69.8MB in the end (delta: -23.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.18ms. Allocated memory is still 100.7MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.30ms. Allocated memory is still 100.7MB. Free memory was 67.7MB in the beginning and 65.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 694.82ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 46.8MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17587.98ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 46.1MB in the beginning and 45.1MB in the end (delta: 1.0MB). Peak memory consumption was 48.9MB. 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:19:29,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:19:32,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:19:32,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:19:32,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:19:32,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:19:32,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:19:32,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:19:32,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:19:32,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:19:32,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:19:32,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:19:32,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:19:32,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:19:32,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:19:32,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:19:32,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:19:32,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:19:32,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:19:32,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:19:32,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:19:32,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:19:32,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:19:32,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:19:32,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:19:32,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:19:32,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:19:32,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:19:32,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:19:32,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:19:32,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:19:32,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:19:32,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:19:32,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:19:32,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:19:32,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:19:32,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:19:32,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:19:32,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:19:32,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:19:32,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:19:32,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:19:32,989 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-21 00:19:33,044 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:19:33,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:19:33,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:19:33,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:19:33,047 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:19:33,047 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:19:33,047 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:19:33,048 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:19:33,048 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:19:33,048 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:19:33,050 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:19:33,050 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:19:33,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 00:19:33,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 00:19:33,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:19:33,053 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:19:33,053 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 00:19:33,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:19:33,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:19:33,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:19:33,054 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 00:19:33,055 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 00:19:33,055 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 00:19:33,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:19:33,055 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 00:19:33,056 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 00:19:33,056 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 00:19:33,056 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:19:33,056 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:19:33,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:19:33,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 00:19:33,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:19:33,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:19:33,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:19:33,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:19:33,059 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 00:19:33,059 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 00:19:33,059 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:19:33,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:19:33,060 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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2021-11-21 00:19:33,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:19:33,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:19:33,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:19:33,534 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:19:33,535 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:19:33,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-11-21 00:19:33,618 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/data/be21e12eb/cb7426b79f4546458278b150fbd8e72a/FLAGac2712478 [2021-11-21 00:19:34,396 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:19:34,397 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2021-11-21 00:19:34,422 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/data/be21e12eb/cb7426b79f4546458278b150fbd8e72a/FLAGac2712478 [2021-11-21 00:19:34,634 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/data/be21e12eb/cb7426b79f4546458278b150fbd8e72a [2021-11-21 00:19:34,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:19:34,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:19:34,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:19:34,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:19:34,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:19:34,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:19:34" (1/1) ... [2021-11-21 00:19:34,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc1e89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:34, skipping insertion in model container [2021-11-21 00:19:34,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:19:34" (1/1) ... [2021-11-21 00:19:34,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:19:34,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:19:35,100 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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2021-11-21 00:19:35,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:19:35,120 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:19:35,198 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_9766e32a-9ea7-4f2c-8776-3b4b267f095f/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2021-11-21 00:19:35,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:19:35,254 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:19:35,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:35 WrapperNode [2021-11-21 00:19:35,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:19:35,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:19:35,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:19:35,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:19:35,267 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:19:35" (1/1) ... [2021-11-21 00:19:35,306 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:19:35" (1/1) ... [2021-11-21 00:19:35,372 INFO L137 Inliner]: procedures = 130, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2021-11-21 00:19:35,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:19:35,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:19:35,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:19:35,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:19:35,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:35" (1/1) ... [2021-11-21 00:19:35,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:35" (1/1) ... [2021-11-21 00:19:35,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:35" (1/1) ... [2021-11-21 00:19:35,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:35" (1/1) ... [2021-11-21 00:19:35,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:35" (1/1) ... [2021-11-21 00:19:35,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:35" (1/1) ... [2021-11-21 00:19:35,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:35" (1/1) ... [2021-11-21 00:19:35,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:19:35,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:19:35,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:19:35,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:19:35,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:35" (1/1) ... [2021-11-21 00:19:35,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:19:35,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:19:35,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:19:35,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:19:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-21 00:19:35,557 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 00:19:35,557 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 00:19:35,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 00:19:35,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:19:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:19:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 00:19:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 00:19:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:19:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-21 00:19:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 00:19:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 00:19:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:19:35,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:19:35,752 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:19:35,754 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:19:36,512 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:19:36,525 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:19:36,526 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 00:19:36,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:19:36 BoogieIcfgContainer [2021-11-21 00:19:36,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:19:36,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:19:36,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:19:36,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:19:36,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:19:34" (1/3) ... [2021-11-21 00:19:36,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a4f938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:19:36, skipping insertion in model container [2021-11-21 00:19:36,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:19:35" (2/3) ... [2021-11-21 00:19:36,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a4f938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:19:36, skipping insertion in model container [2021-11-21 00:19:36,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:19:36" (3/3) ... [2021-11-21 00:19:36,541 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2021-11-21 00:19:36,552 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:19:36,553 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2021-11-21 00:19:36,628 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:19:36,644 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:19:36,644 INFO L340 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2021-11-21 00:19:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 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:19:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 00:19:36,685 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:36,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:19:36,687 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:36,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904761, now seen corresponding path program 1 times [2021-11-21 00:19:36,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:19:36,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143012603] [2021-11-21 00:19:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:36,710 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:19:36,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:19:36,716 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:19:36,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 00:19:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:36,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 00:19:36,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:19:36,971 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:19:37,006 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:19:37,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:19:37,039 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:19:37,040 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:19:37,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143012603] [2021-11-21 00:19:37,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143012603] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:19:37,042 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:19:37,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 00:19:37,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991174905] [2021-11-21 00:19:37,045 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:19:37,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:19:37,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:19:37,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:19:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:19:37,088 INFO L87 Difference]: Start difference. First operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:19:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:19:37,290 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2021-11-21 00:19:37,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:19:37,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2021-11-21 00:19:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:19:37,303 INFO L225 Difference]: With dead ends: 83 [2021-11-21 00:19:37,304 INFO L226 Difference]: Without dead ends: 80 [2021-11-21 00:19:37,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:19:37,311 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:19:37,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 00:19:37,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-21 00:19:37,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-11-21 00:19:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 76 states have internal predecessors, (82), 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:19:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2021-11-21 00:19:37,366 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 7 [2021-11-21 00:19:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:19:37,367 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2021-11-21 00:19:37,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:19:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2021-11-21 00:19:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 00:19:37,368 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:37,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:19:37,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:19:37,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:19:37,582 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:37,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904762, now seen corresponding path program 1 times [2021-11-21 00:19:37,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:19:37,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919892488] [2021-11-21 00:19:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:37,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:19:37,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:19:37,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:19:37,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 00:19:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:37,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 00:19:37,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:19:37,729 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:19:37,783 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:19:37,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:19:37,902 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:19:37,903 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:19:37,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919892488] [2021-11-21 00:19:37,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919892488] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:19:37,904 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:19:37,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-21 00:19:37,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239268680] [2021-11-21 00:19:37,905 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:19:37,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:19:37,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:19:37,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:19:37,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:19:37,911 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:19:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:19:38,269 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2021-11-21 00:19:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:19:38,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 7 [2021-11-21 00:19:38,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:19:38,272 INFO L225 Difference]: With dead ends: 78 [2021-11-21 00:19:38,273 INFO L226 Difference]: Without dead ends: 78 [2021-11-21 00:19:38,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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:19:38,275 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:19:38,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 00:19:38,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-21 00:19:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-11-21 00:19:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 74 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:19:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2021-11-21 00:19:38,295 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 7 [2021-11-21 00:19:38,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:19:38,296 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2021-11-21 00:19:38,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:19:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2021-11-21 00:19:38,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 00:19:38,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:38,297 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:19:38,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 00:19:38,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:19:38,501 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:38,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810752, now seen corresponding path program 1 times [2021-11-21 00:19:38,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:19:38,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563330218] [2021-11-21 00:19:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:38,510 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:19:38,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:19:38,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:19:38,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 00:19:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:38,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:19:38,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:19:38,659 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:19:38,784 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:19:38,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:19:38,928 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:19:38,930 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:19:38,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563330218] [2021-11-21 00:19:38,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563330218] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:19:38,932 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:19:38,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-21 00:19:38,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594497426] [2021-11-21 00:19:38,933 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:19:38,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:19:38,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:19:38,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:19:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:19:38,936 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:19:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:19:39,383 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2021-11-21 00:19:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:19:39,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2021-11-21 00:19:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:19:39,388 INFO L225 Difference]: With dead ends: 82 [2021-11-21 00:19:39,388 INFO L226 Difference]: Without dead ends: 82 [2021-11-21 00:19:39,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:19:39,390 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:19:39,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 268 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-21 00:19:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-21 00:19:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2021-11-21 00:19:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 73 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:19:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2021-11-21 00:19:39,405 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 13 [2021-11-21 00:19:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:19:39,407 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2021-11-21 00:19:39,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:19:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2021-11-21 00:19:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 00:19:39,408 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:39,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:19:39,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 00:19:39,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:19:39,623 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:39,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:39,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810753, now seen corresponding path program 1 times [2021-11-21 00:19:39,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:19:39,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629804527] [2021-11-21 00:19:39,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:39,625 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:19:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:19:39,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:19:39,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 00:19:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:39,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 00:19:39,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:19:39,809 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:19:39,996 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:19:39,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:19:40,515 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:19:40,516 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:19:40,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629804527] [2021-11-21 00:19:40,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629804527] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:19:40,516 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:19:40,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-21 00:19:40,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727017474] [2021-11-21 00:19:40,517 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:19:40,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 00:19:40,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:19:40,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 00:19:40,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-21 00:19:40,519 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:19:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:19:41,460 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2021-11-21 00:19:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:19:41,466 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-11-21 00:19:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:19:41,467 INFO L225 Difference]: With dead ends: 81 [2021-11-21 00:19:41,467 INFO L226 Difference]: Without dead ends: 81 [2021-11-21 00:19:41,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 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:19:41,469 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 11 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:19:41,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 331 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-21 00:19:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-21 00:19:41,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2021-11-21 00:19:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 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:19:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2021-11-21 00:19:41,483 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2021-11-21 00:19:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:19:41,484 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2021-11-21 00:19:41,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:19:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2021-11-21 00:19:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 00:19:41,486 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:41,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:19:41,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 00:19:41,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:19:41,693 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:41,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1399608384, now seen corresponding path program 1 times [2021-11-21 00:19:41,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:19:41,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833938652] [2021-11-21 00:19:41,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:41,697 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:19:41,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:19:41,698 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:19:41,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-21 00:19:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:41,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 00:19:41,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:19:41,811 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:19:41,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:19:41,860 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:19:41,861 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:19:41,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833938652] [2021-11-21 00:19:41,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833938652] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:19:41,863 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:19:41,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 00:19:41,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709118960] [2021-11-21 00:19:41,864 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:19:41,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:19:41,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:19:41,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:19:41,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:19:41,866 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:19:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:19:41,888 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2021-11-21 00:19:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:19:41,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-11-21 00:19:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:19:41,890 INFO L225 Difference]: With dead ends: 83 [2021-11-21 00:19:41,890 INFO L226 Difference]: Without dead ends: 83 [2021-11-21 00:19:41,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:19:41,892 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 8 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:19:41,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 232 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:19:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-11-21 00:19:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-11-21 00:19:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 00:19:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2021-11-21 00:19:41,905 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 15 [2021-11-21 00:19:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:19:41,906 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2021-11-21 00:19:41,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 00:19:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2021-11-21 00:19:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-21 00:19:41,908 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:41,908 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:19:41,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-21 00:19:42,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:19:42,109 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:19:42,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:42,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186176, now seen corresponding path program 1 times [2021-11-21 00:19:42,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:19:42,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040646849] [2021-11-21 00:19:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:42,111 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:19:42,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:19:42,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:19:42,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-21 00:19:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:42,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-21 00:19:42,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:19:42,312 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:19:42,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-11-21 00:19:42,641 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 00:19:42,641 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 26 treesize of output 33 [2021-11-21 00:19:43,017 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:19:43,018 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 37 treesize of output 33 [2021-11-21 00:19:43,369 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 00:19:43,370 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 56 treesize of output 67 [2021-11-21 00:19:44,537 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 00:19:44,537 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 59 treesize of output 70 [2021-11-21 00:19:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:19:44,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:20:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:20:32,772 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:20:32,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040646849] [2021-11-21 00:20:32,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040646849] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:20:32,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2009110854] [2021-11-21 00:20:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:32,773 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:20:32,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:20:32,783 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:20:32,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-21 00:20:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:33,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-21 00:20:33,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:20:33,265 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-21 00:20:33,265 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 17 treesize of output 22 [2021-11-21 00:20:33,529 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:20:33,530 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 27 [2021-11-21 00:20:35,906 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 00:20:35,906 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 37 treesize of output 48 [2021-11-21 00:20:36,739 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 00:20:36,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 50 [2021-11-21 00:20:45,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:45,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:45,423 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-21 00:20:45,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 76 [2021-11-21 00:20:47,085 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 00:20:47,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 51 [2021-11-21 00:20:49,449 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-21 00:20:49,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 90 [2021-11-21 00:20:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-21 00:20:50,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:21:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-21 00:21:29,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2009110854] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 00:21:29,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:21:29,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 10, 11] total 33 [2021-11-21 00:21:29,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949541587] [2021-11-21 00:21:29,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:21:29,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 00:21:29,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:21:29,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 00:21:29,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=915, Unknown=30, NotChecked=0, Total=1122 [2021-11-21 00:21:29,366 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 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:21:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:21:29,533 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2021-11-21 00:21:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 00:21:29,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 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 41 [2021-11-21 00:21:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:21:29,535 INFO L225 Difference]: With dead ends: 92 [2021-11-21 00:21:29,535 INFO L226 Difference]: Without dead ends: 92 [2021-11-21 00:21:29,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 117 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 94.6s TimeCoverageRelationStatistics Valid=177, Invalid=915, Unknown=30, NotChecked=0, Total=1122 [2021-11-21 00:21:29,536 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 56 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:21:29,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 148 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2021-11-21 00:21:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-21 00:21:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2021-11-21 00:21:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 00:21:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2021-11-21 00:21:29,544 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 41 [2021-11-21 00:21:29,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:21:29,545 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2021-11-21 00:21:29,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 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:21:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2021-11-21 00:21:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-21 00:21:29,546 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:21:29,547 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:21:29,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2021-11-21 00:21:29,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-21 00:21:29,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:21:29,949 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:21:29,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:21:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186175, now seen corresponding path program 1 times [2021-11-21 00:21:29,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:21:29,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601953072] [2021-11-21 00:21:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:21:29,950 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:21:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:21:29,951 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:21:29,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-21 00:21:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:21:30,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 00:21:30,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:21:30,171 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:21:30,187 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:21:30,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-11-21 00:21:30,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-21 00:21:30,595 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:21:30,596 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 29 treesize of output 31 [2021-11-21 00:21:30,607 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:21:30,608 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 28 treesize of output 24 [2021-11-21 00:21:30,852 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:21:30,853 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 14 treesize of output 14 [2021-11-21 00:21:31,231 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 00:21:31,231 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 33 treesize of output 38 [2021-11-21 00:21:32,302 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-21 00:21:32,303 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 27 treesize of output 36 [2021-11-21 00:21:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:21:32,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:21:44,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_55| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)))) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| .cse0))))) is different from false [2021-11-21 00:21:47,955 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) is different from false [2021-11-21 00:23:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 7 times theorem prover too weak. 0 trivial. 14 not checked. [2021-11-21 00:23:33,077 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:23:33,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601953072] [2021-11-21 00:23:33,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601953072] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:23:33,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1626966443] [2021-11-21 00:23:33,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:23:33,077 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:23:33,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:23:33,079 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:23:33,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-21 00:23:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:23:33,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 00:23:33,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:23:33,335 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:23:34,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-21 00:23:40,954 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:23:40,955 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 15 treesize of output 17 [2021-11-21 00:23:41,607 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:23:41,609 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 17 treesize of output 13 [2021-11-21 00:23:54,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:23:54,322 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-21 00:23:54,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 25 [2021-11-21 00:23:56,952 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 00:23:56,952 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 17 treesize of output 13 [2021-11-21 00:24:03,340 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 00:24:03,341 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 32 treesize of output 37 [2021-11-21 00:24:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-21 00:24:03,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:26:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 21 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-21 00:26:49,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1626966443] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:26:49,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857360613] [2021-11-21 00:26:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:26:49,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:26:49,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:26:49,474 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:26:49,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-21 00:26:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:26:49,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-21 00:26:49,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:26:49,612 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:26:49,628 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:26:59,020 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 00:26:59,021 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 34 treesize of output 36 [2021-11-21 00:26:59,057 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-11-21 00:26:59,057 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 33 treesize of output 36 [2021-11-21 00:27:13,040 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 00:27:13,040 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 57 treesize of output 62 [2021-11-21 00:27:13,079 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 00:27:13,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 54 [2021-11-21 00:27:16,685 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-11-21 00:27:16,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 46 [2021-11-21 00:27:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 00:27:18,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:28:06,245 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) is different from false [2021-11-21 00:28:11,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_85| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_85|)))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_85| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) is different from false [2021-11-21 00:28:25,862 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))))) is different from false [2021-11-21 00:28:48,723 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_89| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (= (_ bv0 1) (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_89| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_89|)))))) is different from true [2021-11-21 00:28:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2021-11-21 00:28:48,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857360613] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:28:48,946 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 00:28:48,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11, 10, 13, 11] total 56 [2021-11-21 00:28:48,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761336750] [2021-11-21 00:28:48,946 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 00:28:48,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-11-21 00:28:48,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:28:48,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-11-21 00:28:48,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2144, Unknown=114, NotChecked=618, Total=3192 [2021-11-21 00:28:48,951 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 57 states, 51 states have (on average 3.3333333333333335) internal successors, (170), 42 states have internal predecessors, (170), 16 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (17), 14 states have call predecessors, (17), 16 states have call successors, (17) [2021-11-21 00:28:50,981 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_85| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_85|)))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_85| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_89| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (= (_ bv0 1) (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_89| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_89|)))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_63| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_63|))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) is different from false [2021-11-21 00:28:53,010 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))))) is different from false [2021-11-21 00:28:55,043 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_#res#1.base|)))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (= (store |c_old(#length)| |c_node_create_#res#1.base| (_ bv8 32)) |c_#length|) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))))) is different from false [2021-11-21 00:28:59,881 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_85| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_85|)))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_85| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_89| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_89| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|)))) (not (= (_ bv0 1) (bvneg (select (store |c_#valid| |v_node_create_~temp~0#1.base_89| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_89|)))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_63| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_62| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|)))))))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_62| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_#length| |v_node_create_~temp~0#1.base_63| (_ bv8 32)) |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_63|))))) (= |v_node_create_~temp~0#1.base_58| (_ bv0 32)) (not (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) is different from false [2021-11-21 00:29:01,918 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_58| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_58| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (not (= |v_node_create_~temp~0#1.base_58| (_ bv0 32))) (bvult |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|))))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|)))) (exists ((|v_node_create_~temp~0#1.base_88| (_ BitVec 32)) (|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_88|)))) (= (_ bv0 1) (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_88| (_ bv1 1)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_88| (_ bv8 32)) |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))))))) (and (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (or (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|)) (forall ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store |c_#length| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|)))) (exists ((|v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) (select (store (store |c_old(#length)| |v_ULTIMATE.start_sll_create_#t~ret5#1.base_48| (_ bv8 32)) |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_19|))))))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|)))))) is different from false [2021-11-21 00:30:31,156 WARN L227 SmtUtils]: Spent 22.46s on a formula simplification. DAG size of input: 159 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 00:30:38,669 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)))) (or (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_55| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)) (exists ((|v_node_create_~temp~0#1.base_54| (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| (_ bv4 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_54| (_ bv8 32)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|)))) (not (bvule |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_2| .cse0))))) (= |c_#length| |c_old(#length)|) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from false [2021-11-21 00:30:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:30:48,788 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2021-11-21 00:30:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-21 00:30:48,790 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 51 states have (on average 3.3333333333333335) internal successors, (170), 42 states have internal predecessors, (170), 16 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (17), 14 states have call predecessors, (17), 16 states have call successors, (17) Word has length 41 [2021-11-21 00:30:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:30:48,791 INFO L225 Difference]: With dead ends: 94 [2021-11-21 00:30:48,791 INFO L226 Difference]: Without dead ends: 94 [2021-11-21 00:30:48,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 175 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 460.9s TimeCoverageRelationStatistics Valid=434, Invalid=2761, Unknown=159, NotChecked=1476, Total=4830 [2021-11-21 00:30:48,794 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 30 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 634 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:30:48,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 951 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 634 Unchecked, 0.3s Time] [2021-11-21 00:30:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-21 00:30:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2021-11-21 00:30:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.4375) internal successors, (92), 86 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 00:30:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2021-11-21 00:30:48,802 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 41 [2021-11-21 00:30:48,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:30:48,803 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-11-21 00:30:48,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 51 states have (on average 3.3333333333333335) internal successors, (170), 42 states have internal predecessors, (170), 16 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (17), 14 states have call predecessors, (17), 16 states have call successors, (17) [2021-11-21 00:30:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2021-11-21 00:30:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-21 00:30:48,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:30:48,805 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:30:48,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-21 00:30:49,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-21 00:30:49,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-21 00:30:49,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:30:49,422 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:30:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:30:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1843554242, now seen corresponding path program 1 times [2021-11-21 00:30:49,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:30:49,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59391473] [2021-11-21 00:30:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:30:49,423 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:30:49,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:30:49,424 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:30:49,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-21 00:30:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:30:49,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:30:49,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:30:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 00:30:49,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:30:49,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-11-21 00:30:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 00:30:50,093 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:30:50,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59391473] [2021-11-21 00:30:50,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59391473] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:30:50,093 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:30:50,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-21 00:30:50,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74636321] [2021-11-21 00:30:50,094 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:30:50,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 00:30:50,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:30:50,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 00:30:50,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-21 00:30:50,096 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 00:30:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:30:50,319 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2021-11-21 00:30:50,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:30:50,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2021-11-21 00:30:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:30:50,321 INFO L225 Difference]: With dead ends: 91 [2021-11-21 00:30:50,322 INFO L226 Difference]: Without dead ends: 91 [2021-11-21 00:30:50,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-21 00:30:50,322 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 218 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:30:50,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 116 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 00:30:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-11-21 00:30:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-11-21 00:30:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.40625) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 00:30:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2021-11-21 00:30:50,328 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 43 [2021-11-21 00:30:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:30:50,329 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2021-11-21 00:30:50,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 00:30:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2021-11-21 00:30:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:30:50,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:30:50,331 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:30:50,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-21 00:30:50,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:30:50,541 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:30:50,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:30:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2129100770, now seen corresponding path program 1 times [2021-11-21 00:30:50,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:30:50,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332248033] [2021-11-21 00:30:50,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:30:50,543 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:30:50,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:30:50,543 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:30:50,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-21 00:30:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:30:50,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 00:30:50,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:30:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 00:30:50,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:30:50,802 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-21 00:30:50,802 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 19 treesize of output 18 [2021-11-21 00:30:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 00:30:50,887 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:30:50,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332248033] [2021-11-21 00:30:50,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332248033] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:30:50,887 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:30:50,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-21 00:30:50,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968868419] [2021-11-21 00:30:50,887 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:30:50,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:30:50,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:30:50,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:30:50,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:30:50,889 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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:30:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:30:51,157 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2021-11-21 00:30:51,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 00:30:51,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 45 [2021-11-21 00:30:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:30:51,159 INFO L225 Difference]: With dead ends: 101 [2021-11-21 00:30:51,159 INFO L226 Difference]: Without dead ends: 101 [2021-11-21 00:30:51,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-21 00:30:51,160 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 109 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:30:51,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 91 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 00:30:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-21 00:30:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2021-11-21 00:30:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.375) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 00:30:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2021-11-21 00:30:51,165 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 45 [2021-11-21 00:30:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:30:51,166 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2021-11-21 00:30:51,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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:30:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2021-11-21 00:30:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:30:51,167 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:30:51,168 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:30:51,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-21 00:30:51,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:30:51,387 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:30:51,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:30:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2129100771, now seen corresponding path program 1 times [2021-11-21 00:30:51,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:30:51,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802439718] [2021-11-21 00:30:51,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:30:51,388 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:30:51,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:30:51,389 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:30:51,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-21 00:30:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:30:51,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-21 00:30:51,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:30:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 00:30:51,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:30:51,910 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:30:51,910 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 22 treesize of output 26 [2021-11-21 00:30:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-21 00:30:52,286 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:30:52,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802439718] [2021-11-21 00:30:52,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802439718] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:30:52,286 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:30:52,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-21 00:30:52,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486292766] [2021-11-21 00:30:52,287 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:30:52,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 00:30:52,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:30:52,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 00:30:52,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-21 00:30:52,287 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 00:30:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:30:52,507 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2021-11-21 00:30:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:30:52,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2021-11-21 00:30:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:30:52,509 INFO L225 Difference]: With dead ends: 87 [2021-11-21 00:30:52,509 INFO L226 Difference]: Without dead ends: 87 [2021-11-21 00:30:52,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-11-21 00:30:52,510 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 194 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:30:52,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 93 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 00:30:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-21 00:30:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-11-21 00:30:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.34375) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 00:30:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2021-11-21 00:30:52,515 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 45 [2021-11-21 00:30:52,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:30:52,515 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2021-11-21 00:30:52,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-21 00:30:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2021-11-21 00:30:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:30:52,517 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:30:52,517 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:30:52,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-21 00:30:52,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:30:52,730 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 29 more)] === [2021-11-21 00:30:52,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:30:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253767, now seen corresponding path program 1 times [2021-11-21 00:30:52,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:30:52,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99502551] [2021-11-21 00:30:52,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:30:52,731 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:30:52,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:30:52,732 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:30:52,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-21 00:30:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:30:52,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-21 00:30:52,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:30:53,045 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:30:53,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-11-21 00:30:53,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 00:30:58,666 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 00:30:58,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 67 [2021-11-21 00:30:58,724 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-21 00:30:58,725 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 64 treesize of output 66 [2021-11-21 00:30:58,828 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 00:30:58,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 55 [2021-11-21 00:30:59,540 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 00:30:59,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 46 [2021-11-21 00:30:59,550 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 00:30:59,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2021-11-21 00:31:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:31:00,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:31:15,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (let ((.cse3 (bvadd (_ bv8 32) .cse2))) (and (bvule (bvadd (_ bv4 32) .cse2) .cse3) (bvule .cse3 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))))) is different from false [2021-11-21 00:31:17,307 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (let ((.cse3 (bvadd (_ bv8 32) .cse2))) (and (bvule (bvadd (_ bv4 32) .cse2) .cse3) (bvule .cse3 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))))) is different from true [2021-11-21 00:31:23,704 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_3 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))) (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse1 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse1 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))))) is different from false [2021-11-21 00:31:28,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse0 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse2 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))))) is different from false [2021-11-21 00:31:37,206 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_120| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_119| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_111| (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_111|))) (bvule (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|) (_ bv8 32)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_119| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_119|) .cse0 (_ bv0 32)) |v_node_create_~temp~0#1.offset_111| v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_119|) (bvadd (_ bv4 32) v_prenex_2) (_ bv0 32)) v_prenex_2 v_prenex_1)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) (bvult |v_node_create_~temp~0#1.base_119| |c_#StackHeapBarrier|))) (not (bvult |v_node_create_~temp~0#1.base_120| |c_#StackHeapBarrier|)) (and (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120|) .cse2 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|)) (select (store |c_#length| |v_node_create_~temp~0#1.base_120| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_120|) .cse2 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_120|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_3)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_12|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))))) is different from true [2021-11-21 00:31:37,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 429 treesize of output 417 [2021-11-21 00:31:37,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1045 treesize of output 1001 [2021-11-21 00:31:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2021-11-21 00:31:41,943 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:31:41,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99502551] [2021-11-21 00:31:41,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99502551] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:31:41,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2020674751] [2021-11-21 00:31:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:31:41,944 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:31:41,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:31:41,944 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:31:41,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9766e32a-9ea7-4f2c-8776-3b4b267f095f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-11-21 00:31:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:31:42,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-21 00:31:42,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:31:42,724 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:31:42,753 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:31:47,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-11-21 00:31:47,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 00:32:03,958 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 00:32:03,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 89 [2021-11-21 00:32:04,113 INFO L354 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2021-11-21 00:32:04,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 82 [2021-11-21 00:32:04,156 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-21 00:32:04,156 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 79 treesize of output 79 [2021-11-21 00:32:04,218 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-21 00:32:04,218 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 61 treesize of output 63 [2021-11-21 00:32:05,578 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 00:32:05,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 50 [2021-11-21 00:32:05,589 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-21 00:32:05,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2021-11-21 00:32:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 00:32:06,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:32:30,559 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (let ((.cse1 (bvadd .cse0 (_ bv8 32)))) (and (bvule (bvadd .cse0 (_ bv4 32)) .cse1) (bvule .cse1 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.base_130| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse3 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_130| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))))) (bvult |v_node_create_~temp~0#1.base_130| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_130|))))))))) is different from false [2021-11-21 00:32:32,569 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (let ((.cse1 (bvadd .cse0 (_ bv8 32)))) (and (bvule (bvadd .cse0 (_ bv4 32)) .cse1) (bvule .cse1 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.base_130| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse3 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_130| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130|) .cse3 (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))))) (bvult |v_node_create_~temp~0#1.base_130| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_130|))))))))) is different from true [2021-11-21 00:32:40,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (exists ((|v_node_create_~temp~0#1.base_130| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) .cse1 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_130| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130|) .cse1 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))))) (bvult |v_node_create_~temp~0#1.base_130| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_130|))))))))) is different from false [2021-11-21 00:32:42,031 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))) (forall ((v_DerPreprocessor_7 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (exists ((|v_node_create_~temp~0#1.base_130| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) .cse1 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_130| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130|) .cse1 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2)))))) (bvult |v_node_create_~temp~0#1.base_130| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_130|))))))))) is different from true [2021-11-21 00:32:45,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_130| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) .cse0 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_130| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130|) .cse0 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) (bvult |v_node_create_~temp~0#1.base_130| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_130|))))))) (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse2 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse2 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))))) is different from false [2021-11-21 00:32:56,245 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_131| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_131|)))) (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_131| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_131|) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_131| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_131|) .cse1 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_#length| |v_node_create_~temp~0#1.base_131| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_131| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_131|) .cse1 (_ bv0 32)) |node_create_~temp~0#1.offset| v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((|v_node_create_~temp~0#1.base_130| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_5 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (not (let ((.cse2 (bvadd (_ bv4 32) v_prenex_6))) (bvule (bvadd (_ bv8 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) .cse2 (_ bv0 32)) v_prenex_6 v_prenex_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_130| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_130|) .cse2 (_ bv0 32)) v_prenex_6 v_DerPreprocessor_5)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_122| (_ BitVec 32))) (not (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_130|) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_122|) (_ bv0 32)) |v_node_create_~temp~0#1.offset_122| v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_sll_append_~head#1.offset_BEFORE_CALL_14|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) (bvult |v_node_create_~temp~0#1.base_130| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_130|))))))) (not (bvult |v_node_create_~temp~0#1.base_131| |c_#StackHeapBarrier|)))) is different from true [2021-11-21 00:32:56,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2021-11-21 00:32:56,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1188 treesize of output 1136