./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/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_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:17:52,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:17:52,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:17:52,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:17:52,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:17:52,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:17:52,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:17:52,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:17:52,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:17:52,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:17:52,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:17:52,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:17:52,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:17:52,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:17:52,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:17:52,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:17:52,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:17:52,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:17:52,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:17:52,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:17:52,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:17:52,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:17:52,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:17:52,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:17:52,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:17:52,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:17:52,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:17:52,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:17:52,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:17:52,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:17:52,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:17:52,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:17:52,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:17:52,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:17:52,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:17:52,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:17:52,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:17:52,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:17:52,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:17:52,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:17:52,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:17:52,816 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 01:17:52,852 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:17:52,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:17:52,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:17:52,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:17:52,862 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:17:52,862 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:17:52,862 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:17:52,862 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:17:52,862 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:17:52,862 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:17:52,863 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:17:52,863 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:17:52,863 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:17:52,863 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:17:52,864 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:17:52,864 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:17:52,864 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:17:52,864 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:17:52,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:17:52,865 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:17:52,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:17:52,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:17:52,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:17:52,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:17:52,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:17:52,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:17:52,867 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:17:52,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:17:52,867 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:17:52,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:17:52,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:17:52,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:17:52,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:17:52,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:17:52,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:17:52,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:17:52,869 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:17:52,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:17:52,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:17:52,870 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:17:52,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:17:52,871 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_047c6e04-4c5e-4136-b497-a09f89e621c8/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_047c6e04-4c5e-4136-b497-a09f89e621c8/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 ! call(reach_error())) ) 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2021-11-21 01:17:53,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:17:53,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:17:53,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:17:53,170 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:17:53,171 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:17:53,173 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-21 01:17:53,254 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/data/5be6079c3/4b72010fcf644a1e871d7b1ccdb8179b/FLAGd54b54c59 [2021-11-21 01:17:53,924 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:17:53,924 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-21 01:17:53,950 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/data/5be6079c3/4b72010fcf644a1e871d7b1ccdb8179b/FLAGd54b54c59 [2021-11-21 01:17:54,150 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/data/5be6079c3/4b72010fcf644a1e871d7b1ccdb8179b [2021-11-21 01:17:54,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:17:54,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:17:54,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:17:54,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:17:54,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:17:54,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381f2513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54, skipping insertion in model container [2021-11-21 01:17:54,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:17:54,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:17:54,547 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_047c6e04-4c5e-4136-b497-a09f89e621c8/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-21 01:17:54,550 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:17:54,558 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:17:54,603 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_047c6e04-4c5e-4136-b497-a09f89e621c8/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-21 01:17:54,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:17:54,636 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:17:54,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54 WrapperNode [2021-11-21 01:17:54,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:17:54,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:17:54,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:17:54,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:17:54,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,685 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2021-11-21 01:17:54,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:17:54,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:17:54,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:17:54,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:17:54,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:17:54,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:17:54,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:17:54,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:17:54,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54" (1/1) ... [2021-11-21 01:17:54,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:17:54,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:17:54,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:17:54,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:17:54,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 01:17:54,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 01:17:54,842 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 01:17:54,842 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 01:17:54,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 01:17:54,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:17:54,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:17:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 01:17:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 01:17:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:17:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 01:17:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:17:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:17:54,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:17:54,977 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:17:54,978 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:17:55,333 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:17:55,425 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:17:55,425 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 01:17:55,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:17:55 BoogieIcfgContainer [2021-11-21 01:17:55,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:17:55,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:17:55,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:17:55,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:17:55,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:17:54" (1/3) ... [2021-11-21 01:17:55,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323f39b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:17:55, skipping insertion in model container [2021-11-21 01:17:55,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:17:54" (2/3) ... [2021-11-21 01:17:55,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323f39b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:17:55, skipping insertion in model container [2021-11-21 01:17:55,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:17:55" (3/3) ... [2021-11-21 01:17:55,436 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2021-11-21 01:17:55,442 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:17:55,442 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 01:17:55,494 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:17:55,502 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:17:55,502 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 01:17:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 01:17:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-21 01:17:55,526 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:17:55,527 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:17:55,527 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:17:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:17:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1079724122, now seen corresponding path program 1 times [2021-11-21 01:17:55,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:17:55,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050138290] [2021-11-21 01:17:55,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:17:55,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:17:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:17:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 01:17:55,875 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:17:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050138290] [2021-11-21 01:17:55,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050138290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:17:55,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:17:55,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 01:17:55,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79080815] [2021-11-21 01:17:55,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:17:55,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:17:55,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:17:55,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:17:55,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:17:55,934 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 01:17:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:17:56,073 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2021-11-21 01:17:56,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:17:56,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16 [2021-11-21 01:17:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:17:56,085 INFO L225 Difference]: With dead ends: 45 [2021-11-21 01:17:56,086 INFO L226 Difference]: Without dead ends: 21 [2021-11-21 01:17:56,090 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 01:17:56,094 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:17:56,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:17:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-21 01:17:56,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-11-21 01:17:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 01:17:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-11-21 01:17:56,145 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2021-11-21 01:17:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:17:56,145 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-11-21 01:17:56,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 01:17:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2021-11-21 01:17:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-21 01:17:56,148 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:17:56,149 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:17:56,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:17:56,150 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:17:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:17:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2061360914, now seen corresponding path program 1 times [2021-11-21 01:17:56,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:17:56,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12699536] [2021-11-21 01:17:56,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:17:56,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:17:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:17:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-21 01:17:56,332 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:17:56,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12699536] [2021-11-21 01:17:56,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12699536] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:17:56,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:17:56,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-21 01:17:56,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293575044] [2021-11-21 01:17:56,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:17:56,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:17:56,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:17:56,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:17:56,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:17:56,337 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-21 01:17:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:17:56,451 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2021-11-21 01:17:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 01:17:56,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2021-11-21 01:17:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:17:56,453 INFO L225 Difference]: With dead ends: 26 [2021-11-21 01:17:56,454 INFO L226 Difference]: Without dead ends: 20 [2021-11-21 01:17:56,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-21 01:17:56,456 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:17:56,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:17:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-21 01:17:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-21 01:17:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 01:17:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-11-21 01:17:56,466 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2021-11-21 01:17:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:17:56,467 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-11-21 01:17:56,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-21 01:17:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2021-11-21 01:17:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-21 01:17:56,469 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:17:56,470 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:17:56,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:17:56,470 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:17:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:17:56,471 INFO L85 PathProgramCache]: Analyzing trace with hash 433212228, now seen corresponding path program 1 times [2021-11-21 01:17:56,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:17:56,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453416165] [2021-11-21 01:17:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:17:56,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:17:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:17:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:17:58,634 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:17:58,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453416165] [2021-11-21 01:17:58,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453416165] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:17:58,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939634082] [2021-11-21 01:17:58,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:17:58,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:17:58,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:17:58,641 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:17:58,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 01:17:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:17:58,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 105 conjunts are in the unsatisfiable core [2021-11-21 01:17:58,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:17:58,888 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 01:17:59,010 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 01:17:59,197 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:17:59,198 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 12 treesize of output 14 [2021-11-21 01:17:59,496 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:17:59,498 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 10 [2021-11-21 01:17:59,615 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 01:17:59,786 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-21 01:17:59,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-11-21 01:17:59,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 01:18:00,175 INFO L354 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2021-11-21 01:18:00,176 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 1 case distinctions, treesize of input 40 treesize of output 28 [2021-11-21 01:18:00,424 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 52 treesize of output 36 [2021-11-21 01:18:00,433 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 36 treesize of output 32 [2021-11-21 01:18:00,457 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:18:00,457 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 29 treesize of output 25 [2021-11-21 01:18:04,864 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-21 01:18:04,865 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 114 treesize of output 117 [2021-11-21 01:18:04,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:18:04,896 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-21 01:18:04,897 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 1 case distinctions, treesize of input 98 treesize of output 74 [2021-11-21 01:18:04,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:18:04,920 INFO L354 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2021-11-21 01:18:04,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 81 [2021-11-21 01:18:04,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:18:04,944 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-21 01:18:04,944 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 1 case distinctions, treesize of input 72 treesize of output 60 [2021-11-21 01:18:05,773 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 01:18:05,774 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 389 treesize of output 301 [2021-11-21 01:18:05,805 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 01:18:05,806 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 337 treesize of output 277 [2021-11-21 01:18:05,825 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 231 treesize of output 219 [2021-11-21 01:18:05,853 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-21 01:18:05,854 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 216 treesize of output 204 [2021-11-21 01:18:06,022 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 19 treesize of output 11 [2021-11-21 01:18:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:18:06,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:18:06,255 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-21 01:18:06,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [373339569] [2021-11-21 01:18:06,281 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-21 01:18:06,281 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:18:06,287 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:18:06,293 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:18:06,294 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:18:06,349 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@214075a3 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:92) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:388) 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 01:18:06,352 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-21 01:18:06,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-21 01:18:06,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722503044] [2021-11-21 01:18:06,353 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-21 01:18:06,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-21 01:18:06,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:18:06,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-21 01:18:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1310, Unknown=1, NotChecked=0, Total=1406 [2021-11-21 01:18:06,359 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 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 01:18:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 01:18:06,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=95, Invalid=1310, Unknown=1, NotChecked=0, Total=1406 [2021-11-21 01:18:06,363 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:18:06,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:18:06,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:18:06,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:18:06,580 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@214075a3 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) 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 01:18:06,585 INFO L158 Benchmark]: Toolchain (without parser) took 12428.21ms. Allocated memory was 98.6MB in the beginning and 163.6MB in the end (delta: 65.0MB). Free memory was 66.8MB in the beginning and 108.3MB in the end (delta: -41.4MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2021-11-21 01:18:06,585 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 98.6MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:18:06,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.24ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 66.6MB in the beginning and 94.5MB in the end (delta: -28.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 01:18:06,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.75ms. Allocated memory is still 125.8MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:18:06,587 INFO L158 Benchmark]: Boogie Preprocessor took 61.02ms. Allocated memory is still 125.8MB. Free memory was 92.4MB in the beginning and 90.9MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-21 01:18:06,587 INFO L158 Benchmark]: RCFGBuilder took 679.83ms. Allocated memory is still 125.8MB. Free memory was 90.9MB in the beginning and 71.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-21 01:18:06,588 INFO L158 Benchmark]: TraceAbstraction took 11154.32ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 70.5MB in the beginning and 108.3MB in the end (delta: -37.8MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2021-11-21 01:18:06,591 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.37ms. Allocated memory is still 98.6MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.24ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 66.6MB in the beginning and 94.5MB in the end (delta: -28.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.75ms. Allocated memory is still 125.8MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.02ms. Allocated memory is still 125.8MB. Free memory was 92.4MB in the beginning and 90.9MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 679.83ms. Allocated memory is still 125.8MB. Free memory was 90.9MB in the beginning and 71.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11154.32ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 70.5MB in the beginning and 108.3MB in the end (delta: -37.8MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@214075a3 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@214075a3: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-21 01:18:06,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/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_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/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_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:18:09,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:18:09,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:18:09,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:18:09,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:18:09,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:18:09,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:18:09,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:18:09,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:18:09,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:18:09,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:18:09,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:18:09,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:18:09,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:18:09,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:18:09,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:18:09,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:18:09,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:18:09,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:18:09,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:18:09,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:18:09,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:18:09,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:18:09,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:18:09,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:18:09,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:18:09,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:18:09,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:18:09,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:18:09,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:18:09,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:18:09,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:18:09,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:18:09,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:18:09,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:18:09,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:18:09,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:18:09,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:18:09,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:18:09,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:18:09,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:18:09,804 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-21 01:18:09,837 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:18:09,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:18:09,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:18:09,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:18:09,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:18:09,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:18:09,840 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:18:09,840 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:18:09,841 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:18:09,841 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:18:09,841 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:18:09,842 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:18:09,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:18:09,843 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:18:09,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:18:09,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:18:09,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:18:09,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:18:09,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:18:09,845 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 01:18:09,846 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 01:18:09,846 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:18:09,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:18:09,847 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:18:09,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:18:09,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:18:09,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 01:18:09,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:18:09,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:18:09,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:18:09,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:18:09,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:18:09,850 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 01:18:09,851 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 01:18:09,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:18:09,851 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:18:09,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:18:09,852 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_047c6e04-4c5e-4136-b497-a09f89e621c8/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_047c6e04-4c5e-4136-b497-a09f89e621c8/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 ! call(reach_error())) ) 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2021-11-21 01:18:10,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:18:10,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:18:10,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:18:10,347 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:18:10,348 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:18:10,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-21 01:18:10,437 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/data/3f42de7a3/9742f94d1fda41269a5f9b4b088de1b0/FLAGca2dbad6b [2021-11-21 01:18:11,244 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:18:11,245 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-21 01:18:11,269 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/data/3f42de7a3/9742f94d1fda41269a5f9b4b088de1b0/FLAGca2dbad6b [2021-11-21 01:18:11,442 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/data/3f42de7a3/9742f94d1fda41269a5f9b4b088de1b0 [2021-11-21 01:18:11,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:18:11,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:18:11,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:18:11,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:18:11,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:18:11,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:18:11" (1/1) ... [2021-11-21 01:18:11,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a3f7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:11, skipping insertion in model container [2021-11-21 01:18:11,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:18:11" (1/1) ... [2021-11-21 01:18:11,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:18:11,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:18:12,083 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_047c6e04-4c5e-4136-b497-a09f89e621c8/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-21 01:18:12,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:18:12,119 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:18:12,226 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_047c6e04-4c5e-4136-b497-a09f89e621c8/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-21 01:18:12,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:18:12,273 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:18:12,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12 WrapperNode [2021-11-21 01:18:12,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:18:12,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:18:12,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:18:12,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:18:12,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12" (1/1) ... [2021-11-21 01:18:12,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12" (1/1) ... [2021-11-21 01:18:12,368 INFO L137 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2021-11-21 01:18:12,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:18:12,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:18:12,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:18:12,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:18:12,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12" (1/1) ... [2021-11-21 01:18:12,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12" (1/1) ... [2021-11-21 01:18:12,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12" (1/1) ... [2021-11-21 01:18:12,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12" (1/1) ... [2021-11-21 01:18:12,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12" (1/1) ... [2021-11-21 01:18:12,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12" (1/1) ... [2021-11-21 01:18:12,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12" (1/1) ... [2021-11-21 01:18:12,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:18:12,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:18:12,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:18:12,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:18:12,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12" (1/1) ... [2021-11-21 01:18:12,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:18:12,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:18:12,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:18:12,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:18:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-21 01:18:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 01:18:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 01:18:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 01:18:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:18:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:18:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 01:18:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 01:18:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:18:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-21 01:18:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 01:18:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 01:18:12,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:18:12,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:18:12,697 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:18:12,699 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:18:13,275 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:18:13,282 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:18:13,282 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 01:18:13,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:18:13 BoogieIcfgContainer [2021-11-21 01:18:13,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:18:13,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:18:13,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:18:13,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:18:13,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:18:11" (1/3) ... [2021-11-21 01:18:13,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5311d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:18:13, skipping insertion in model container [2021-11-21 01:18:13,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:18:12" (2/3) ... [2021-11-21 01:18:13,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5311d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:18:13, skipping insertion in model container [2021-11-21 01:18:13,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:18:13" (3/3) ... [2021-11-21 01:18:13,304 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2021-11-21 01:18:13,313 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:18:13,314 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 01:18:13,373 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:18:13,389 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:18:13,391 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 01:18:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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 01:18:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 01:18:13,423 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:18:13,424 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:18:13,424 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:18:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:18:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1369192097, now seen corresponding path program 1 times [2021-11-21 01:18:13,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:18:13,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332856518] [2021-11-21 01:18:13,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:18:13,450 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:18:13,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:18:13,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:18:13,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 01:18:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:18:13,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-21 01:18:13,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:18:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 01:18:13,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:18:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 01:18:13,852 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:18:13,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332856518] [2021-11-21 01:18:13,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332856518] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:18:13,854 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:18:13,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 01:18:13,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390461777] [2021-11-21 01:18:13,857 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:18:13,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 01:18:13,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:18:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 01:18:13,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 01:18:13,898 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:18:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:18:13,924 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2021-11-21 01:18:13,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 01:18:13,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-11-21 01:18:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:18:13,935 INFO L225 Difference]: With dead ends: 65 [2021-11-21 01:18:13,936 INFO L226 Difference]: Without dead ends: 28 [2021-11-21 01:18:13,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 01:18:13,943 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:18:13,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:18:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-11-21 01:18:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-11-21 01:18:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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 01:18:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-11-21 01:18:14,001 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2021-11-21 01:18:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:18:14,003 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-11-21 01:18:14,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:18:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-11-21 01:18:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 01:18:14,006 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:18:14,006 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:18:14,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:18:14,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:18:14,211 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:18:14,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:18:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1579482442, now seen corresponding path program 1 times [2021-11-21 01:18:14,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:18:14,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953825785] [2021-11-21 01:18:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:18:14,215 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:18:14,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:18:14,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:18:14,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 01:18:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:18:14,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:18:14,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:18:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:18:14,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:18:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-21 01:18:14,637 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:18:14,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953825785] [2021-11-21 01:18:14,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953825785] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:18:14,639 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:18:14,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 01:18:14,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798600261] [2021-11-21 01:18:14,650 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:18:14,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:18:14,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:18:14,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:18:14,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:18:14,656 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-21 01:18:14,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:18:14,716 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2021-11-21 01:18:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 01:18:14,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2021-11-21 01:18:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:18:14,725 INFO L225 Difference]: With dead ends: 52 [2021-11-21 01:18:14,725 INFO L226 Difference]: Without dead ends: 31 [2021-11-21 01:18:14,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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 01:18:14,728 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:18:14,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:18:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-11-21 01:18:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-11-21 01:18:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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 01:18:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-11-21 01:18:14,744 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2021-11-21 01:18:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:18:14,745 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-11-21 01:18:14,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-21 01:18:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-11-21 01:18:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-21 01:18:14,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:18:14,750 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:18:14,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:18:14,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:18:14,967 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:18:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:18:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1638915570, now seen corresponding path program 1 times [2021-11-21 01:18:14,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:18:14,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544946588] [2021-11-21 01:18:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:18:14,969 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:18:14,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:18:14,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:18:14,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 01:18:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:18:15,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:18:15,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:18:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-21 01:18:15,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:18:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-21 01:18:15,906 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:18:15,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544946588] [2021-11-21 01:18:15,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544946588] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:18:15,907 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:18:15,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-21 01:18:15,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999017308] [2021-11-21 01:18:15,908 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:18:15,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:18:15,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:18:15,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:18:15,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:18:15,910 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-21 01:18:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:18:15,974 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2021-11-21 01:18:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 01:18:15,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2021-11-21 01:18:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:18:15,977 INFO L225 Difference]: With dead ends: 41 [2021-11-21 01:18:15,977 INFO L226 Difference]: Without dead ends: 30 [2021-11-21 01:18:15,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:18:15,979 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:18:15,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 106 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:18:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-21 01:18:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-11-21 01:18:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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 01:18:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-11-21 01:18:15,989 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 33 [2021-11-21 01:18:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:18:15,990 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-11-21 01:18:15,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-21 01:18:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2021-11-21 01:18:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-21 01:18:15,992 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:18:15,992 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:18:16,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:18:16,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:18:16,214 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:18:16,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:18:16,215 INFO L85 PathProgramCache]: Analyzing trace with hash 802467380, now seen corresponding path program 1 times [2021-11-21 01:18:16,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:18:16,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324857999] [2021-11-21 01:18:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:18:16,216 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:18:16,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:18:16,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:18:16,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 01:18:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:18:16,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-21 01:18:16,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:18:16,671 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 01:18:17,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 01:18:17,483 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 01:18:17,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-11-21 01:18:17,689 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 01:18:17,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 01:18:18,098 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-21 01:18:18,099 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 62 [2021-11-21 01:18:18,144 INFO L354 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-11-21 01:18:18,144 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 76 treesize of output 52 [2021-11-21 01:18:18,732 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-11-21 01:18:18,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 73 [2021-11-21 01:18:18,751 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:18:18,752 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 64 treesize of output 60 [2021-11-21 01:18:18,762 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 21 treesize of output 17 [2021-11-21 01:18:18,767 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 15 treesize of output 11 [2021-11-21 01:18:23,749 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-21 01:18:23,750 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 200 treesize of output 203 [2021-11-21 01:18:24,066 INFO L354 Elim1Store]: treesize reduction 296, result has 10.0 percent of original size [2021-11-21 01:18:24,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 184 treesize of output 140 [2021-11-21 01:18:24,191 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 01:18:24,192 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 169 treesize of output 145 [2021-11-21 01:18:24,257 INFO L354 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2021-11-21 01:18:24,258 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 154 treesize of output 156 [2021-11-21 01:18:26,431 INFO L354 Elim1Store]: treesize reduction 290, result has 11.3 percent of original size [2021-11-21 01:18:26,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 265 treesize of output 171 [2021-11-21 01:18:26,715 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-21 01:18:26,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 302 treesize of output 221 [2021-11-21 01:18:26,842 INFO L354 Elim1Store]: treesize reduction 298, result has 8.3 percent of original size [2021-11-21 01:18:26,843 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 284 treesize of output 187 [2021-11-21 01:18:27,264 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-21 01:18:27,265 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 41 [2021-11-21 01:18:27,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 35 treesize of output 27 [2021-11-21 01:18:27,523 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 31 treesize of output 23 [2021-11-21 01:18:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:18:27,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:18:30,040 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_DerPreprocessor_4)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-21 01:18:32,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_DerPreprocessor_4)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-21 01:18:34,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_4)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-11-21 01:18:47,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (not (= (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_4)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))))) is different from false [2021-11-21 01:18:49,808 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (not (= (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_4)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))))) is different from true [2021-11-21 01:19:16,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse4 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse8 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_10))) (.cse6 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_9)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_8) .cse4 |node_create_~data#1|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |c_node_create_~temp~0#1.base| (store (select .cse0 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |c_node_create_~temp~0#1.base|)))) (store .cse5 |c_node_create_~temp~0#1.base| (store (select .cse5 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |c_node_create_~temp~0#1.base| (store (select .cse7 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (_ bv4 32))))))) (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= (let ((.cse13 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse17 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_7))) (.cse15 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_6)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse13 |v_node_create_~data#1_26|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_prenex_1))))) (store .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_2))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_4))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 v_prenex_3)))) (store .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)))))) is different from false [2021-11-21 01:19:18,776 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse4 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse8 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_10))) (.cse6 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_9)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_8) .cse4 |node_create_~data#1|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |c_node_create_~temp~0#1.base| (store (select .cse0 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |c_node_create_~temp~0#1.base|)))) (store .cse5 |c_node_create_~temp~0#1.base| (store (select .cse5 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |c_node_create_~temp~0#1.base| (store (select .cse7 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (_ bv4 32))))))) (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= (let ((.cse13 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse17 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_7))) (.cse15 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_6)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse13 |v_node_create_~data#1_26|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_prenex_1))))) (store .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_2))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_4))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 v_prenex_3)))) (store .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)))))) is different from true [2021-11-21 01:20:09,221 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_29| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (= (let ((.cse4 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_29| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_10))) (.cse6 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse4 v_DerPreprocessor_9)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |v_node_create_~temp~0#1.base_29| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| v_DerPreprocessor_8) .cse4 |node_create_~data#1|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_node_create_~temp~0#1.base_29| (store (select .cse0 |v_node_create_~temp~0#1.base_29|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_node_create_~temp~0#1.base_29|)))) (store .cse5 |v_node_create_~temp~0#1.base_29| (store (select .cse5 |v_node_create_~temp~0#1.base_29|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_node_create_~temp~0#1.base_29| (store (select .cse7 |v_node_create_~temp~0#1.base_29|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (_ bv4 32)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|) (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= (let ((.cse13 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse17 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_7))) (.cse15 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse13 v_DerPreprocessor_6)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse13 |v_node_create_~data#1_26|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_prenex_1))))) (store .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_2))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse14 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_4))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 v_prenex_3)))) (store .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse16 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_3 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_29|)))) (not (bvult |v_node_create_~temp~0#1.base_29| |c_#StackHeapBarrier|)))) is different from true [2021-11-21 01:20:09,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 348403 treesize of output 343407 [2021-11-21 01:20:10,096 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:20:10,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324857999] [2021-11-21 01:20:10,097 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-21 01:20:10,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [410096573] [2021-11-21 01:20:10,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:10,098 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:20:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:20:10,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:20:10,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-21 01:20:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:10,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-21 01:20:10,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:20:10,643 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 01:20:11,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 01:20:11,323 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 01:20:11,323 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 27 treesize of output 34 [2021-11-21 01:20:11,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 01:20:12,315 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-21 01:20:12,316 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 47 treesize of output 35 [2021-11-21 01:20:13,208 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 72 treesize of output 56 [2021-11-21 01:20:13,224 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:20:13,224 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 56 treesize of output 52 [2021-11-21 01:20:13,237 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 21 treesize of output 17 [2021-11-21 01:20:13,245 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 15 treesize of output 11 [2021-11-21 01:20:15,968 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-21 01:20:15,969 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 151 treesize of output 154 [2021-11-21 01:20:16,101 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 01:20:16,101 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 135 treesize of output 111 [2021-11-21 01:20:16,198 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 01:20:16,198 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 120 treesize of output 108 [2021-11-21 01:20:16,276 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-21 01:20:16,276 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 105 treesize of output 107 [2021-11-21 01:20:18,237 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-21 01:20:18,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 150 [2021-11-21 01:20:18,521 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-21 01:20:18,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 267 treesize of output 190 [2021-11-21 01:20:18,605 INFO L354 Elim1Store]: treesize reduction 298, result has 8.3 percent of original size [2021-11-21 01:20:18,606 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 249 treesize of output 152 [2021-11-21 01:20:18,700 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-21 01:20:18,701 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 41 [2021-11-21 01:20:18,708 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 35 treesize of output 27 [2021-11-21 01:20:18,977 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 31 treesize of output 23 [2021-11-21 01:20:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:20:18,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:20:44,376 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_DerPreprocessor_14)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-21 01:20:46,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_14)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-11-21 01:20:58,021 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_14)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|))))))) is different from false [2021-11-21 01:21:00,029 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_14)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|))))))) is different from true [2021-11-21 01:21:31,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_6)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))) (= (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_20))) (.cse15 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_19)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_18) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_14))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) is different from false [2021-11-21 01:21:33,261 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_6)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))) (= (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_20))) (.cse15 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_19)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_18) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_14))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) is different from true [2021-11-21 01:22:28,152 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_33|))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_7))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_5) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_4))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 v_DerPreprocessor_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_6)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))) (= (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_33| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_33|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_20))) (.cse15 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_33| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_33|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_19)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |v_node_create_~temp~0#1.base_33| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_33|) |node_create_~temp~0#1.offset| v_DerPreprocessor_18) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_14))))) (store .cse9 |v_node_create_~temp~0#1.base_33| (store (select .cse9 |v_node_create_~temp~0#1.base_33|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_13))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_node_create_~temp~0#1.base_33|)))) (store .cse14 |v_node_create_~temp~0#1.base_33| (store (select .cse14 |v_node_create_~temp~0#1.base_33|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |v_node_create_~temp~0#1.base_33| (store (select .cse16 |v_node_create_~temp~0#1.base_33|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) (not (bvult |v_node_create_~temp~0#1.base_33| |c_#StackHeapBarrier|)))) is different from true [2021-11-21 01:22:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66561 treesize of output 64485 [2021-11-21 01:22:28,679 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 13212574 treesize of output 13064258 [2021-11-21 01:22:48,691 WARN L227 SmtUtils]: Spent 19.98s on a formula simplification that was a NOOP. DAG size: 5128 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-21 01:23:07,488 WARN L227 SmtUtils]: Spent 18.77s on a formula simplification that was a NOOP. DAG size: 5125 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-21 01:23:07,669 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-21 01:23:07,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414971524] [2021-11-21 01:23:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:23:07,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:23:07,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:23:07,677 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:23:07,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-21 01:23:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:23:07,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-21 01:23:07,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:23:07,851 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 01:23:08,836 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 01:23:08,836 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 25 treesize of output 32 [2021-11-21 01:23:09,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 01:23:10,124 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-11-21 01:23:10,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 60 [2021-11-21 01:23:10,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-21 01:23:11,188 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-21 01:23:11,189 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 1 case distinctions, treesize of input 48 treesize of output 36 [2021-11-21 01:23:21,682 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-21 01:23:21,683 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 164 treesize of output 167 [2021-11-21 01:23:21,769 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 01:23:21,770 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 148 treesize of output 124 [2021-11-21 01:23:21,850 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 01:23:21,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 121 [2021-11-21 01:23:21,932 INFO L354 Elim1Store]: treesize reduction 44, result has 27.9 percent of original size [2021-11-21 01:23:21,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 122 [2021-11-21 01:23:25,931 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-21 01:23:25,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 149 [2021-11-21 01:23:26,122 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-21 01:23:26,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 266 treesize of output 189 [2021-11-21 01:23:26,201 INFO L354 Elim1Store]: treesize reduction 298, result has 8.3 percent of original size [2021-11-21 01:23:26,202 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 248 treesize of output 151 [2021-11-21 01:23:26,549 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-21 01:23:26,549 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2021-11-21 01:23:26,554 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 26 treesize of output 18 [2021-11-21 01:23:26,803 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 15 treesize of output 7 [2021-11-21 01:23:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:23:26,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:23:28,945 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_DerPreprocessor_24)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-21 01:23:31,072 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_DerPreprocessor_24)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-21 01:23:33,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_24)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-11-21 01:23:36,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse3 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_24))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|))))))) is different from false [2021-11-21 01:23:39,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_24))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_24)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))) is different from false [2021-11-21 01:23:41,593 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_24))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_24)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))) is different from true [2021-11-21 01:24:04,957 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_8))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_10))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_9))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_7)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_11))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_29))) (.cse15 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_30)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_28) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_24))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))))) is different from false [2021-11-21 01:24:06,962 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_8))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_10))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_9))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_7)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_11))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_29))) (.cse15 (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|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_30)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_28) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_24))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))))) is different from true [2021-11-21 01:24:50,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_37| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_37|)))) (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_8))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_10))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_9))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_7)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_11))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_29))) (.cse15 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_30)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| v_DerPreprocessor_28) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_24))))) (store .cse9 |v_node_create_~temp~0#1.base_37| (store (select .cse9 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_node_create_~temp~0#1.base_37|)))) (store .cse14 |v_node_create_~temp~0#1.base_37| (store (select .cse14 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |v_node_create_~temp~0#1.base_37| (store (select .cse16 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))))))) is different from false [2021-11-21 01:24:52,497 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_37| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_37|)))) (forall ((|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_36| (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_36|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_27))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| (_ bv0 32)) .cse4 v_DerPreprocessor_26)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |v_node_create_~temp~0#1.offset_36| v_DerPreprocessor_25) .cse4 |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_8))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_10))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_9))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_7)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) v_prenex_7 v_prenex_11))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|) (_ bv4 32)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_29))) (.cse15 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_30)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |v_node_create_~temp~0#1.base_37| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_37|) |node_create_~temp~0#1.offset| v_DerPreprocessor_28) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_24))))) (store .cse9 |v_node_create_~temp~0#1.base_37| (store (select .cse9 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_23))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_node_create_~temp~0#1.base_37|)))) (store .cse14 |v_node_create_~temp~0#1.base_37| (store (select .cse14 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |v_node_create_~temp~0#1.base_37| (store (select .cse16 |v_node_create_~temp~0#1.base_37|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))))))))))) is different from true [2021-11-21 01:24:52,527 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 166758 treesize of output 158610 [2021-11-21 01:24:52,924 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 24715032 treesize of output 23980260 [2021-11-21 01:25:29,077 WARN L227 SmtUtils]: Spent 36.15s on a formula simplification that was a NOOP. DAG size: 4455 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-21 01:26:05,352 WARN L227 SmtUtils]: Spent 36.26s on a formula simplification that was a NOOP. DAG size: 4452 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-21 01:26:05,404 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-21 01:26:05,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:26:05,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-21 01:26:05,405 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-11-21 01:26:05,405 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-21 01:26:05,413 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 01:26:05,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 01:26:05,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-21 01:26:05,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2021-11-21 01:26:06,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt [2021-11-21 01:26:06,037 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-11-21 01:26:06,040 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 01:26:06,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:26:06 BoogieIcfgContainer [2021-11-21 01:26:06,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 01:26:06,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 01:26:06,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 01:26:06,058 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 01:26:06,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:18:13" (3/4) ... [2021-11-21 01:26:06,061 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-21 01:26:06,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 01:26:06,062 INFO L158 Benchmark]: Toolchain (without parser) took 474614.12ms. Allocated memory was 75.5MB in the beginning and 750.8MB in the end (delta: 675.3MB). Free memory was 55.5MB in the beginning and 571.2MB in the end (delta: -515.6MB). Peak memory consumption was 159.4MB. Max. memory is 16.1GB. [2021-11-21 01:26:06,062 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 75.5MB. Free memory was 55.5MB in the beginning and 55.4MB in the end (delta: 95.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:26:06,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 823.10ms. Allocated memory is still 75.5MB. Free memory was 55.3MB in the beginning and 50.0MB in the end (delta: 5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 01:26:06,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.74ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 47.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:26:06,063 INFO L158 Benchmark]: Boogie Preprocessor took 75.24ms. Allocated memory is still 75.5MB. Free memory was 47.6MB in the beginning and 45.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:26:06,064 INFO L158 Benchmark]: RCFGBuilder took 848.21ms. Allocated memory is still 75.5MB. Free memory was 45.8MB in the beginning and 54.4MB in the end (delta: -8.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2021-11-21 01:26:06,064 INFO L158 Benchmark]: TraceAbstraction took 472760.98ms. Allocated memory was 75.5MB in the beginning and 750.8MB in the end (delta: 675.3MB). Free memory was 54.0MB in the beginning and 572.2MB in the end (delta: -518.2MB). Peak memory consumption was 455.7MB. Max. memory is 16.1GB. [2021-11-21 01:26:06,064 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 750.8MB. Free memory was 572.2MB in the beginning and 571.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:26:06,067 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.36ms. Allocated memory is still 75.5MB. Free memory was 55.5MB in the beginning and 55.4MB in the end (delta: 95.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 823.10ms. Allocated memory is still 75.5MB. Free memory was 55.3MB in the beginning and 50.0MB in the end (delta: 5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.74ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 47.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.24ms. Allocated memory is still 75.5MB. Free memory was 47.6MB in the beginning and 45.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 848.21ms. Allocated memory is still 75.5MB. Free memory was 45.8MB in the beginning and 54.4MB in the end (delta: -8.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * TraceAbstraction took 472760.98ms. Allocated memory was 75.5MB in the beginning and 750.8MB in the end (delta: 675.3MB). Free memory was 54.0MB in the beginning and 572.2MB in the end (delta: -518.2MB). Peak memory consumption was 455.7MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 750.8MB. Free memory was 572.2MB in the beginning and 571.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 647]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L629] const int len = 2; [L630] const int data = 1; [L631] SLL s = sll_circular_create(len, data); [L631] CALL, EXPR sll_circular_create(len, data) [L584] CALL, EXPR node_create(data) [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L584] RET, EXPR node_create(data) [L584] SLL head = node_create(data); [L585] SLL last = head; [L586] COND TRUE len > 1 [L587] CALL, EXPR node_create(data) [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L587] RET, EXPR node_create(data) [L587] SLL new_head = node_create(data); [L588] new_head->next = head [L589] head = new_head [L590] len-- [L586] COND FALSE !(len > 1) [L592] last->next = head [L593] return head; [L631] RET, EXPR sll_circular_create(len, data) [L631] SLL s = sll_circular_create(len, data); [L632] CALL sll_circular_insert(&s, data, len / 2) [L607] CALL, EXPR node_create(data) [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L607] RET, EXPR node_create(data) [L607] SLL new_node = node_create(data); [L608] SLL snd_to_last = ((void *)0); [L609] EXPR \read(*head) [L609] SLL last = *head; [L610] COND TRUE index > 0 [L611] snd_to_last = last [L612] EXPR last->next [L612] last = last->next [L613] index-- [L610] COND FALSE !(index > 0) [L615] COND TRUE \read(snd_to_last) [L616] snd_to_last->next = new_node [L617] new_node->next = last [L632] RET sll_circular_insert(&s, data, len / 2) [L633] EXPR \read(s) [L633] SLL ptr = s; [L634] int count = 0; [L636] EXPR ptr->data [L636] COND TRUE data != ptr->data [L647] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 472.7s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 112 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 114.8s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 193 ConstructedInterpolants, 13 QuantifiedInterpolants, 1790 SizeOfPredicates, 42 NumberOfNonLiveVariables, 556 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 59/69 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-21 01:26:06,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_047c6e04-4c5e-4136-b497-a09f89e621c8/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN