./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/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_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:32:51,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:32:51,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:32:51,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:32:51,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:32:51,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:32:51,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:32:51,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:32:51,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:32:51,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:32:51,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:32:51,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:32:51,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:32:51,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:32:51,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:32:51,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:32:51,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:32:51,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:32:51,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:32:51,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:32:51,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:32:51,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:32:51,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:32:51,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:32:51,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:32:51,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:32:51,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:32:51,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:32:51,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:32:51,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:32:51,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:32:51,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:32:51,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:32:51,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:32:51,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:32:51,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:32:51,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:32:51,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:32:51,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:32:51,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:32:51,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:32:51,772 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-21 01:32:51,807 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:32:51,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:32:51,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:32:51,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:32:51,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:32:51,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:32:51,809 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:32:51,809 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:32:51,809 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:32:51,809 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:32:51,810 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:32:51,810 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:32:51,810 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:32:51,810 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:32:51,811 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:32:51,811 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:32:51,811 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:32:51,811 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:32:51,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 01:32:51,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 01:32:51,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:32:51,813 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:32:51,813 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 01:32:51,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:32:51,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:32:51,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:32:51,814 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 01:32:51,814 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 01:32:51,814 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 01:32:51,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:32:51,815 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 01:32:51,815 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:32:51,815 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:32:51,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:32:51,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:32:51,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:32:51,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:32:51,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:32:51,816 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:32:51,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:32:51,817 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:32:51,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:32:51,817 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_7620784e-4d51-43aa-9990-8ce2ca2e37cc/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_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2021-11-21 01:32:52,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:32:52,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:32:52,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:32:52,110 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:32:52,111 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:32:52,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-21 01:32:52,183 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/data/054ce7907/e2775ea15d6647f6b65e4fb42bc5ce31/FLAGae5bbfaea [2021-11-21 01:32:52,662 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:32:52,663 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-21 01:32:52,686 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/data/054ce7907/e2775ea15d6647f6b65e4fb42bc5ce31/FLAGae5bbfaea [2021-11-21 01:32:52,992 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/data/054ce7907/e2775ea15d6647f6b65e4fb42bc5ce31 [2021-11-21 01:32:52,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:32:52,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:32:52,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:32:52,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:32:53,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:32:53,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:32:52" (1/1) ... [2021-11-21 01:32:53,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30822677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:32:53, skipping insertion in model container [2021-11-21 01:32:53,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:32:52" (1/1) ... [2021-11-21 01:32:53,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:32:53,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:32:53,355 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_7620784e-4d51-43aa-9990-8ce2ca2e37cc/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-21 01:32:53,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:32:53,365 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:32:53,408 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_7620784e-4d51-43aa-9990-8ce2ca2e37cc/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-21 01:32:53,409 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:32:53,440 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:32:53,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:32:53 WrapperNode [2021-11-21 01:32:53,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:32:53,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:32:53,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:32:53,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:32:53,452 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:32:53" (1/1) ... [2021-11-21 01:32:53,481 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:32:53" (1/1) ... [2021-11-21 01:32:53,524 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2021-11-21 01:32:53,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:32:53,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:32:53,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:32:53,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:32:53,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:32:53" (1/1) ... [2021-11-21 01:32:53,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:32:53" (1/1) ... [2021-11-21 01:32:53,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:32:53" (1/1) ... [2021-11-21 01:32:53,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:32:53" (1/1) ... [2021-11-21 01:32:53,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:32:53" (1/1) ... [2021-11-21 01:32:53,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:32:53" (1/1) ... [2021-11-21 01:32:53,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:32:53" (1/1) ... [2021-11-21 01:32:53,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:32:53,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:32:53,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:32:53,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:32:53,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:32:53" (1/1) ... [2021-11-21 01:32:53,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:32:53,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:32:53,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:32:53,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:32:53,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 01:32:53,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 01:32:53,711 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 01:32:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 01:32:53,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 01:32:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:32:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:32:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 01:32:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 01:32:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:32:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 01:32:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:32:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:32:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:32:53,887 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:32:53,889 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:32:54,255 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:32:54,302 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:32:54,302 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 01:32:54,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:32:54 BoogieIcfgContainer [2021-11-21 01:32:54,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:32:54,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:32:54,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:32:54,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:32:54,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:32:52" (1/3) ... [2021-11-21 01:32:54,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398b6c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:32:54, skipping insertion in model container [2021-11-21 01:32:54,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:32:53" (2/3) ... [2021-11-21 01:32:54,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398b6c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:32:54, skipping insertion in model container [2021-11-21 01:32:54,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:32:54" (3/3) ... [2021-11-21 01:32:54,313 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2021-11-21 01:32:54,318 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:32:54,318 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-11-21 01:32:54,361 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:32:54,369 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:32:54,369 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-11-21 01:32:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 48 states have (on average 2.3125) internal successors, (111), 100 states have internal predecessors, (111), 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:32:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-21 01:32:54,394 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:32:54,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-21 01:32:54,395 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:32:54,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:32:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash 224891455, now seen corresponding path program 1 times [2021-11-21 01:32:54,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:32:54,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548769516] [2021-11-21 01:32:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:32:54,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:32:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:32:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:32:54,644 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:32:54,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548769516] [2021-11-21 01:32:54,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548769516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:32:54,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:32:54,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:32:54,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76517069] [2021-11-21 01:32:54,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:32:54,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:32:54,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:32:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:32:54,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:32:54,683 INFO L87 Difference]: Start difference. First operand has 105 states, 48 states have (on average 2.3125) internal successors, (111), 100 states have internal predecessors, (111), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:32:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:32:54,810 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-11-21 01:32:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:32:54,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-21 01:32:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:32:54,822 INFO L225 Difference]: With dead ends: 103 [2021-11-21 01:32:54,822 INFO L226 Difference]: Without dead ends: 101 [2021-11-21 01:32:54,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:32:54,828 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:32:54,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:32:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-21 01:32:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-11-21 01:32:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 96 states have internal predecessors, (104), 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:32:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2021-11-21 01:32:54,877 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 5 [2021-11-21 01:32:54,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:32:54,878 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2021-11-21 01:32:54,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:32:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2021-11-21 01:32:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-21 01:32:54,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:32:54,879 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-21 01:32:54,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:32:54,880 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:32:54,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:32:54,881 INFO L85 PathProgramCache]: Analyzing trace with hash 224891456, now seen corresponding path program 1 times [2021-11-21 01:32:54,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:32:54,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046824172] [2021-11-21 01:32:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:32:54,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:32:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:32:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:32:54,955 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:32:54,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046824172] [2021-11-21 01:32:54,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046824172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:32:54,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:32:54,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:32:54,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978014521] [2021-11-21 01:32:54,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:32:54,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:32:54,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:32:54,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:32:54,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:32:54,959 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:32:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:32:55,075 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2021-11-21 01:32:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:32:55,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-21 01:32:55,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:32:55,079 INFO L225 Difference]: With dead ends: 99 [2021-11-21 01:32:55,080 INFO L226 Difference]: Without dead ends: 99 [2021-11-21 01:32:55,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:32:55,083 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:32:55,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 147 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:32:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-21 01:32:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-11-21 01:32:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 94 states have internal predecessors, (102), 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:32:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2021-11-21 01:32:55,109 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 5 [2021-11-21 01:32:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:32:55,110 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2021-11-21 01:32:55,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:32:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2021-11-21 01:32:55,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:32:55,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:32:55,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:32:55,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:32:55,114 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:32:55,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:32:55,115 INFO L85 PathProgramCache]: Analyzing trace with hash -739070550, now seen corresponding path program 1 times [2021-11-21 01:32:55,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:32:55,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043920621] [2021-11-21 01:32:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:32:55,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:32:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:32:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:32:55,224 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:32:55,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043920621] [2021-11-21 01:32:55,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043920621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:32:55,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:32:55,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:32:55,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685023009] [2021-11-21 01:32:55,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:32:55,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:32:55,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:32:55,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:32:55,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:32:55,228 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:32:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:32:55,450 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2021-11-21 01:32:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:32:55,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-21 01:32:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:32:55,458 INFO L225 Difference]: With dead ends: 103 [2021-11-21 01:32:55,459 INFO L226 Difference]: Without dead ends: 103 [2021-11-21 01:32:55,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:32:55,469 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:32:55,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 277 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:32:55,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-21 01:32:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2021-11-21 01:32:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 49 states have (on average 2.163265306122449) internal successors, (106), 96 states have internal predecessors, (106), 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:32:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-11-21 01:32:55,500 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 10 [2021-11-21 01:32:55,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:32:55,501 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-11-21 01:32:55,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:32:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-11-21 01:32:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:32:55,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:32:55,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:32:55,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 01:32:55,503 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:32:55,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:32:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash -739070549, now seen corresponding path program 1 times [2021-11-21 01:32:55,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:32:55,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561715547] [2021-11-21 01:32:55,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:32:55,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:32:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:32:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:32:55,579 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:32:55,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561715547] [2021-11-21 01:32:55,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561715547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:32:55,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:32:55,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 01:32:55,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647426903] [2021-11-21 01:32:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:32:55,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:32:55,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:32:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:32:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:32:55,584 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:32:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:32:55,627 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-11-21 01:32:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:32:55,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-21 01:32:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:32:55,630 INFO L225 Difference]: With dead ends: 100 [2021-11-21 01:32:55,630 INFO L226 Difference]: Without dead ends: 100 [2021-11-21 01:32:55,632 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:32:55,642 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 4 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:32:55,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 176 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:32:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-21 01:32:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-11-21 01:32:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 95 states have internal predecessors, (103), 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:32:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2021-11-21 01:32:55,659 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 10 [2021-11-21 01:32:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:32:55,660 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2021-11-21 01:32:55,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:32:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2021-11-21 01:32:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 01:32:55,661 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:32:55,661 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:32:55,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 01:32:55,662 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:32:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:32:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1505132138, now seen corresponding path program 1 times [2021-11-21 01:32:55,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:32:55,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55357702] [2021-11-21 01:32:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:32:55,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:32:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:32:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 01:32:55,773 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:32:55,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55357702] [2021-11-21 01:32:55,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55357702] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:32:55,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:32:55,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:32:55,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430239953] [2021-11-21 01:32:55,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:32:55,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:32:55,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:32:55,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:32:55,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:32:55,776 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:32:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:32:55,993 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2021-11-21 01:32:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:32:55,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-21 01:32:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:32:55,996 INFO L225 Difference]: With dead ends: 100 [2021-11-21 01:32:55,996 INFO L226 Difference]: Without dead ends: 100 [2021-11-21 01:32:55,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:32:55,997 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:32:56,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 283 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:32:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-21 01:32:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2021-11-21 01:32:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 48 states have (on average 2.125) internal successors, (102), 94 states have internal predecessors, (102), 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:32:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2021-11-21 01:32:56,020 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 17 [2021-11-21 01:32:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:32:56,021 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2021-11-21 01:32:56,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:32:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2021-11-21 01:32:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 01:32:56,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:32:56,022 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:32:56,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-21 01:32:56,023 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:32:56,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:32:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1505132139, now seen corresponding path program 1 times [2021-11-21 01:32:56,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:32:56,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776282072] [2021-11-21 01:32:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:32:56,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:32:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:32:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:32:56,128 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:32:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776282072] [2021-11-21 01:32:56,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776282072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:32:56,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:32:56,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:32:56,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011158445] [2021-11-21 01:32:56,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:32:56,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:32:56,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:32:56,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:32:56,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:32:56,131 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:32:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:32:56,320 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2021-11-21 01:32:56,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:32:56,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2021-11-21 01:32:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:32:56,321 INFO L225 Difference]: With dead ends: 99 [2021-11-21 01:32:56,321 INFO L226 Difference]: Without dead ends: 99 [2021-11-21 01:32:56,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:32:56,322 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 7 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:32:56,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 307 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:32:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-21 01:32:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-11-21 01:32:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 93 states have internal predecessors, (101), 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:32:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2021-11-21 01:32:56,330 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 17 [2021-11-21 01:32:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:32:56,330 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2021-11-21 01:32:56,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:32:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2021-11-21 01:32:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-21 01:32:56,337 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:32:56,337 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:32:56,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-21 01:32:56,338 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:32:56,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:32:56,338 INFO L85 PathProgramCache]: Analyzing trace with hash -971798934, now seen corresponding path program 1 times [2021-11-21 01:32:56,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:32:56,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779690719] [2021-11-21 01:32:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:32:56,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:32:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:32:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:32:56,523 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:32:56,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779690719] [2021-11-21 01:32:56,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779690719] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:32:56,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168588660] [2021-11-21 01:32:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:32:56,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:32:56,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:32:56,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:32:56,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 01:32:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:32:56,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-21 01:32:56,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:32:56,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:32:56,794 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-21 01:32:56,795 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 14 treesize of output 9 [2021-11-21 01:32:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:32:56,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-21 01:32:56,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168588660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:32:56,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 01:32:56,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2021-11-21 01:32:56,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20270656] [2021-11-21 01:32:56,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:32:56,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-21 01:32:56,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:32:56,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-21 01:32:56,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-21 01:32:56,870 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:32:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:32:57,150 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2021-11-21 01:32:57,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-21 01:32:57,151 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-11-21 01:32:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:32:57,152 INFO L225 Difference]: With dead ends: 116 [2021-11-21 01:32:57,152 INFO L226 Difference]: Without dead ends: 116 [2021-11-21 01:32:57,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-21 01:32:57,153 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 90 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:32:57,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 302 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:32:57,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-21 01:32:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2021-11-21 01:32:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 92 states have internal predecessors, (100), 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:32:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-11-21 01:32:57,160 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 19 [2021-11-21 01:32:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:32:57,160 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-11-21 01:32:57,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:32:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-11-21 01:32:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-21 01:32:57,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:32:57,161 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:32:57,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:32:57,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:32:57,381 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:32:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:32:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash -971798933, now seen corresponding path program 1 times [2021-11-21 01:32:57,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:32:57,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303799888] [2021-11-21 01:32:57,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:32:57,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:32:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:32:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:32:57,561 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:32:57,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303799888] [2021-11-21 01:32:57,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303799888] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:32:57,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334711611] [2021-11-21 01:32:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:32:57,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:32:57,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:32:57,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:32:57,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 01:32:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:32:57,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-21 01:32:57,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:32:57,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:32:57,826 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-21 01:32:57,826 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 14 treesize of output 9 [2021-11-21 01:32:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:32:57,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:32:57,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334711611] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:32:57,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [598828629] [2021-11-21 01:32:58,010 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-21 01:32:58,010 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:32:58,015 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:32:58,024 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:32:58,025 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:32:58,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:32:58,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:32:58,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-21 01:32:58,242 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 01:32:58,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 01:32:58,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-21 01:32:58,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-21 01:32:58,355 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:32:58,365 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:32:58,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-21 01:32:58,427 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:32:58,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:32:58,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-21 01:32:58,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:32:58,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-21 01:32:58,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:32:58,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:32:58,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 01:32:58,644 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 01:32:58,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 01:32:58,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:32:58,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:32:58,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-11-21 01:32:59,135 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:32:59,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:32:59,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:32:59,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:32:59,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:32:59,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:32:59,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:32:59,439 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:32:59,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:32:59,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:32:59,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:32:59,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:32:59,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:32:59,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:32:59,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-21 01:32:59,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:32:59,949 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:32:59,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-21 01:33:00,284 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:33:00,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:33:00,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:00,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:00,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:00,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:33:00,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:33:00,589 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:33:00,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:33:00,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:00,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:00,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:33:00,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:33:01,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:33:01,084 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:33:01,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-21 01:33:01,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-21 01:33:01,463 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:33:01,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:33:01,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:33:01,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:01,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:01,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:01,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:33:01,684 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:33:01,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:33:01,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:33:01,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-11-21 01:33:01,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:01,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:01,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-21 01:33:02,140 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-21 01:33:02,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 20 [2021-11-21 01:33:02,518 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-21 01:33:02,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 41 [2021-11-21 01:33:02,559 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 88 for LOIs [2021-11-21 01:33:04,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:33:04,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:33:04,587 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Some non-self update cases but no top-level DER relation at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:340) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:278) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-21 01:33:04,590 INFO L158 Benchmark]: Toolchain (without parser) took 11594.32ms. Allocated memory was 109.1MB in the beginning and 186.6MB in the end (delta: 77.6MB). Free memory was 67.3MB in the beginning and 109.7MB in the end (delta: -42.5MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2021-11-21 01:33:04,590 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:33:04,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.05ms. Allocated memory is still 109.1MB. Free memory was 67.1MB in the beginning and 75.0MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 01:33:04,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.67ms. Allocated memory is still 109.1MB. Free memory was 75.0MB in the beginning and 72.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:33:04,591 INFO L158 Benchmark]: Boogie Preprocessor took 67.53ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:33:04,591 INFO L158 Benchmark]: RCFGBuilder took 711.32ms. Allocated memory is still 109.1MB. Free memory was 70.8MB in the beginning and 47.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-21 01:33:04,592 INFO L158 Benchmark]: TraceAbstraction took 10282.78ms. Allocated memory was 109.1MB in the beginning and 186.6MB in the end (delta: 77.6MB). Free memory was 47.3MB in the beginning and 109.7MB in the end (delta: -62.5MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2021-11-21 01:33:04,594 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.18ms. Allocated memory is still 109.1MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.05ms. Allocated memory is still 109.1MB. Free memory was 67.1MB in the beginning and 75.0MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.67ms. Allocated memory is still 109.1MB. Free memory was 75.0MB in the beginning and 72.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.53ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 711.32ms. Allocated memory is still 109.1MB. Free memory was 70.8MB in the beginning and 47.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10282.78ms. Allocated memory was 109.1MB in the beginning and 186.6MB in the end (delta: 77.6MB). Free memory was 47.3MB in the beginning and 109.7MB in the end (delta: -62.5MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Some non-self update cases but no top-level DER relation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Some non-self update cases but no top-level DER relation: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-21 01:33:04,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/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_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:33:07,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:33:07,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:33:07,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:33:07,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:33:07,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:33:07,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:33:07,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:33:07,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:33:07,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:33:07,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:33:07,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:33:07,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:33:07,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:33:07,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:33:07,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:33:07,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:33:07,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:33:07,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:33:07,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:33:07,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:33:07,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:33:07,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:33:07,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:33:07,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:33:07,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:33:07,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:33:07,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:33:07,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:33:07,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:33:07,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:33:07,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:33:07,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:33:07,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:33:07,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:33:07,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:33:07,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:33:07,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:33:07,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:33:07,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:33:07,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:33:07,143 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-21 01:33:07,185 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:33:07,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:33:07,186 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:33:07,187 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:33:07,187 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:33:07,188 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:33:07,188 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:33:07,188 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:33:07,188 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:33:07,189 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:33:07,190 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:33:07,190 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:33:07,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-21 01:33:07,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-21 01:33:07,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:33:07,192 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:33:07,192 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 01:33:07,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:33:07,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:33:07,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:33:07,193 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-21 01:33:07,193 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-21 01:33:07,193 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-21 01:33:07,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:33:07,194 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-21 01:33:07,194 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 01:33:07,194 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 01:33:07,195 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:33:07,195 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:33:07,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:33:07,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 01:33:07,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:33:07,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:33:07,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:33:07,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:33:07,197 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 01:33:07,197 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 01:33:07,197 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:33:07,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:33:07,198 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_7620784e-4d51-43aa-9990-8ce2ca2e37cc/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_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2021-11-21 01:33:07,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:33:07,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:33:07,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:33:07,606 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:33:07,607 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:33:07,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-21 01:33:07,685 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/data/69cb35fdc/fe1b25dba14c4c3b9b8fc14f107e984f/FLAG9e1a5a845 [2021-11-21 01:33:08,264 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:33:08,264 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2021-11-21 01:33:08,281 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/data/69cb35fdc/fe1b25dba14c4c3b9b8fc14f107e984f/FLAG9e1a5a845 [2021-11-21 01:33:08,534 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/data/69cb35fdc/fe1b25dba14c4c3b9b8fc14f107e984f [2021-11-21 01:33:08,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:33:08,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:33:08,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:33:08,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:33:08,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:33:08,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:33:08" (1/1) ... [2021-11-21 01:33:08,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d36400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:33:08, skipping insertion in model container [2021-11-21 01:33:08,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:33:08" (1/1) ... [2021-11-21 01:33:08,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:33:08,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:33:08,914 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_7620784e-4d51-43aa-9990-8ce2ca2e37cc/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-21 01:33:08,916 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:33:08,928 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:33:08,971 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_7620784e-4d51-43aa-9990-8ce2ca2e37cc/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2021-11-21 01:33:08,972 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:33:09,006 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:33:09,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:33:09 WrapperNode [2021-11-21 01:33:09,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:33:09,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:33:09,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:33:09,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:33:09,015 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:33:09" (1/1) ... [2021-11-21 01:33:09,033 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:33:09" (1/1) ... [2021-11-21 01:33:09,060 INFO L137 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 148 [2021-11-21 01:33:09,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:33:09,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:33:09,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:33:09,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:33:09,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:33:09" (1/1) ... [2021-11-21 01:33:09,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:33:09" (1/1) ... [2021-11-21 01:33:09,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:33:09" (1/1) ... [2021-11-21 01:33:09,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:33:09" (1/1) ... [2021-11-21 01:33:09,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:33:09" (1/1) ... [2021-11-21 01:33:09,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:33:09" (1/1) ... [2021-11-21 01:33:09,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:33:09" (1/1) ... [2021-11-21 01:33:09,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:33:09,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:33:09,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:33:09,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:33:09,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:33:09" (1/1) ... [2021-11-21 01:33:09,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:33:09,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:33:09,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:33:09,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:33:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-21 01:33:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-21 01:33:09,215 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-21 01:33:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-21 01:33:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:33:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:33:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-21 01:33:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-21 01:33:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:33:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-21 01:33:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-21 01:33:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 01:33:09,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:33:09,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:33:09,357 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:33:09,359 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:33:09,944 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:33:09,952 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:33:09,954 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-21 01:33:09,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:33:09 BoogieIcfgContainer [2021-11-21 01:33:09,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:33:09,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:33:09,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:33:09,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:33:09,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:33:08" (1/3) ... [2021-11-21 01:33:09,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41388057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:33:09, skipping insertion in model container [2021-11-21 01:33:09,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:33:09" (2/3) ... [2021-11-21 01:33:09,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41388057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:33:09, skipping insertion in model container [2021-11-21 01:33:09,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:33:09" (3/3) ... [2021-11-21 01:33:09,969 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2021-11-21 01:33:09,977 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:33:09,978 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-11-21 01:33:10,041 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:33:10,054 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:33:10,054 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-11-21 01:33:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 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:33:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 01:33:10,092 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:33:10,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 01:33:10,093 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:33:10,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:33:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash 895367701, now seen corresponding path program 1 times [2021-11-21 01:33:10,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:33:10,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029165225] [2021-11-21 01:33:10,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:33:10,114 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:33:10,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:33:10,117 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:33:10,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 01:33:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:33:10,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 01:33:10,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:33:10,337 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:33:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:33:10,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:33:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:33:10,417 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:33:10,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029165225] [2021-11-21 01:33:10,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029165225] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:33:10,418 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:33:10,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 01:33:10,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121117799] [2021-11-21 01:33:10,423 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:33:10,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:33:10,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:33:10,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:33:10,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:33:10,470 INFO L87 Difference]: Start difference. First operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 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, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:33:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:33:10,751 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2021-11-21 01:33:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:33:10,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 01:33:10,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:33:10,764 INFO L225 Difference]: With dead ends: 119 [2021-11-21 01:33:10,764 INFO L226 Difference]: Without dead ends: 116 [2021-11-21 01:33:10,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:33:10,770 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:33:10,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:33:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-21 01:33:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-11-21 01:33:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.9193548387096775) internal successors, (119), 111 states have internal predecessors, (119), 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:33:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2021-11-21 01:33:10,818 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 6 [2021-11-21 01:33:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:33:10,819 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2021-11-21 01:33:10,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:33:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2021-11-21 01:33:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 01:33:10,820 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:33:10,820 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 01:33:10,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:33:11,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:33:11,031 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:33:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:33:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash 895367702, now seen corresponding path program 1 times [2021-11-21 01:33:11,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:33:11,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497363066] [2021-11-21 01:33:11,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:33:11,039 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:33:11,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:33:11,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:33:11,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 01:33:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:33:11,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 01:33:11,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:33:11,159 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:33:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:33:11,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:33:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:33:11,288 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:33:11,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497363066] [2021-11-21 01:33:11,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497363066] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:33:11,289 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:33:11,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-21 01:33:11,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95832265] [2021-11-21 01:33:11,290 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:33:11,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:33:11,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:33:11,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:33:11,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:33:11,292 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:33:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:33:11,895 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2021-11-21 01:33:11,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:33:11,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 01:33:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:33:11,899 INFO L225 Difference]: With dead ends: 114 [2021-11-21 01:33:11,899 INFO L226 Difference]: Without dead ends: 114 [2021-11-21 01:33:11,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:33:11,901 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-21 01:33:11,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 263 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-21 01:33:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-21 01:33:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-11-21 01:33:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 62 states have (on average 1.8870967741935485) internal successors, (117), 109 states have internal predecessors, (117), 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:33:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2021-11-21 01:33:11,914 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 6 [2021-11-21 01:33:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:33:11,927 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2021-11-21 01:33:11,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:33:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2021-11-21 01:33:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 01:33:11,928 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:33:11,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:33:11,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:33:12,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:33:12,139 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:33:12,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:33:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1575141079, now seen corresponding path program 1 times [2021-11-21 01:33:12,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:33:12,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422278155] [2021-11-21 01:33:12,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:33:12,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:33:12,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:33:12,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:33:12,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 01:33:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:33:12,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:33:12,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:33:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:33:12,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:33:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:33:12,328 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:33:12,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422278155] [2021-11-21 01:33:12,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422278155] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:33:12,329 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:33:12,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-21 01:33:12,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030441382] [2021-11-21 01:33:12,330 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:33:12,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:33:12,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:33:12,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:33:12,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:33:12,331 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:33:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:33:12,350 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2021-11-21 01:33:12,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 01:33:12,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2021-11-21 01:33:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:33:12,353 INFO L225 Difference]: With dead ends: 121 [2021-11-21 01:33:12,353 INFO L226 Difference]: Without dead ends: 121 [2021-11-21 01:33:12,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:33:12,355 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 9 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 350 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:33:12,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 350 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:33:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-21 01:33:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2021-11-21 01:33:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.873015873015873) internal successors, (118), 110 states have internal predecessors, (118), 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:33:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2021-11-21 01:33:12,368 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 13 [2021-11-21 01:33:12,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:33:12,369 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2021-11-21 01:33:12,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:33:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2021-11-21 01:33:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-21 01:33:12,370 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:33:12,370 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:33:12,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:33:12,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:33:12,582 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:33:12,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:33:12,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086820, now seen corresponding path program 1 times [2021-11-21 01:33:12,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:33:12,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754987567] [2021-11-21 01:33:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:33:12,586 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:33:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:33:12,588 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:33:12,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 01:33:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:33:12,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:33:12,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:33:12,740 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:33:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:33:12,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:33:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:33:12,898 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:33:12,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754987567] [2021-11-21 01:33:12,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754987567] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:33:12,899 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:33:12,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-21 01:33:12,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868063214] [2021-11-21 01:33:12,899 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:33:12,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:33:12,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:33:12,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:33:12,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:33:12,901 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:33:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:33:13,405 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2021-11-21 01:33:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:33:13,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-11-21 01:33:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:33:13,408 INFO L225 Difference]: With dead ends: 115 [2021-11-21 01:33:13,409 INFO L226 Difference]: Without dead ends: 115 [2021-11-21 01:33:13,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:33:13,410 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 12 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 01:33:13,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 364 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-21 01:33:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-21 01:33:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2021-11-21 01:33:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 109 states have internal predecessors, (117), 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:33:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2021-11-21 01:33:13,419 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 22 [2021-11-21 01:33:13,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:33:13,420 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2021-11-21 01:33:13,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:33:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2021-11-21 01:33:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-21 01:33:13,421 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:33:13,421 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:33:13,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 01:33:13,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:33:13,632 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:33:13,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:33:13,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086819, now seen corresponding path program 1 times [2021-11-21 01:33:13,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:33:13,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030371133] [2021-11-21 01:33:13,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:33:13,634 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:33:13,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:33:13,635 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:33:13,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-21 01:33:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:33:13,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 01:33:13,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:33:13,778 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:33:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:33:13,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:33:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:33:14,314 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:33:14,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030371133] [2021-11-21 01:33:14,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030371133] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:33:14,314 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:33:14,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-21 01:33:14,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593482946] [2021-11-21 01:33:14,315 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:33:14,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 01:33:14,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:33:14,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 01:33:14,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:33:14,317 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 01:33:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:33:15,570 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2021-11-21 01:33:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:33:15,571 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2021-11-21 01:33:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:33:15,573 INFO L225 Difference]: With dead ends: 114 [2021-11-21 01:33:15,573 INFO L226 Difference]: Without dead ends: 114 [2021-11-21 01:33:15,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-21 01:33:15,574 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 22 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:33:15,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 527 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-21 01:33:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-21 01:33:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2021-11-21 01:33:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 108 states have internal predecessors, (116), 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:33:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2021-11-21 01:33:15,584 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 22 [2021-11-21 01:33:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:33:15,585 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2021-11-21 01:33:15,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 01:33:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2021-11-21 01:33:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 01:33:15,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:33:15,587 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:33:15,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-21 01:33:15,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:33:15,795 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:33:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:33:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578181, now seen corresponding path program 1 times [2021-11-21 01:33:15,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:33:15,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085000010] [2021-11-21 01:33:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:33:15,796 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:33:15,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:33:15,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:33:15,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-21 01:33:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:33:15,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-21 01:33:15,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:33:15,921 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:33:16,107 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 01:33:16,108 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:33:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:33:16,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:33:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:33:42,199 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:33:42,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085000010] [2021-11-21 01:33:42,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085000010] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:33:42,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1526120296] [2021-11-21 01:33:42,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:33:42,200 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:33:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:33:42,214 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:33:42,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-21 01:33:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:33:42,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-21 01:33:42,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:33:42,413 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:33:46,546 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-21 01:33:46,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2021-11-21 01:33:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:33:46,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:33:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:33:54,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1526120296] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 01:33:54,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:33:54,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 8, 6] total 18 [2021-11-21 01:33:54,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435533965] [2021-11-21 01:33:54,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:33:54,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-21 01:33:54,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:33:54,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-21 01:33:54,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=269, Unknown=14, NotChecked=0, Total=342 [2021-11-21 01:33:54,996 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:33:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:33:57,695 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2021-11-21 01:33:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:33:57,696 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-11-21 01:33:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:33:57,697 INFO L225 Difference]: With dead ends: 130 [2021-11-21 01:33:57,698 INFO L226 Difference]: Without dead ends: 130 [2021-11-21 01:33:57,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=69, Invalid=296, Unknown=15, NotChecked=0, Total=380 [2021-11-21 01:33:57,699 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 100 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-21 01:33:57,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 381 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 293 Invalid, 0 Unknown, 44 Unchecked, 0.7s Time] [2021-11-21 01:33:57,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-21 01:33:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2021-11-21 01:33:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 107 states have internal predecessors, (115), 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:33:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2021-11-21 01:33:57,707 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 25 [2021-11-21 01:33:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:33:57,708 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2021-11-21 01:33:57,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 01:33:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2021-11-21 01:33:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 01:33:57,710 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:33:57,710 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:33:57,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-21 01:33:57,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-21 01:33:58,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 01:33:58,113 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:33:58,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:33:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578182, now seen corresponding path program 1 times [2021-11-21 01:33:58,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:33:58,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589125056] [2021-11-21 01:33:58,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:33:58,115 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:33:58,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:33:58,116 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:33:58,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-21 01:33:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:33:58,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 01:33:58,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:33:58,250 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:33:58,257 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:33:58,554 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:33:58,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-21 01:33:58,565 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 01:33:58,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2021-11-21 01:33:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:33:58,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:34:12,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) is different from false [2021-11-21 01:34:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:34:15,747 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:34:15,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589125056] [2021-11-21 01:34:15,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589125056] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:34:15,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1232515895] [2021-11-21 01:34:15,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:34:15,749 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:34:15,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:34:15,755 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:34:15,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-11-21 01:34:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:34:15,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 01:34:15,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:34:15,973 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:34:15,995 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:34:16,302 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:34:16,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2021-11-21 01:34:16,317 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 01:34:16,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2021-11-21 01:34:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:34:16,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:34:35,004 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) is different from false [2021-11-21 01:34:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:34:35,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1232515895] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:34:35,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527917485] [2021-11-21 01:34:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:34:35,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:34:35,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:34:35,548 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:34:35,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-21 01:34:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:34:35,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 01:34:35,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:34:35,644 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:34:40,022 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:34:40,023 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 31 treesize of output 33 [2021-11-21 01:34:40,038 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 01:34:40,039 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 30 treesize of output 30 [2021-11-21 01:34:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:34:40,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:35:00,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse0) (bvule .cse0 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse1)) (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|))))))))) is different from false [2021-11-21 01:35:01,042 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-21 01:35:01,042 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 34 treesize of output 33 [2021-11-21 01:35:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:35:03,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527917485] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:35:03,473 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 01:35:03,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 9, 9] total 21 [2021-11-21 01:35:03,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420584056] [2021-11-21 01:35:03,474 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 01:35:03,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-21 01:35:03,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:35:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-21 01:35:03,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=279, Unknown=19, NotChecked=108, Total=462 [2021-11-21 01:35:03,477 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-21 01:35:05,687 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_old(#valid)| |c_#valid|) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) (= |c_#length| |c_old(#length)|) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))))))))) is different from false [2021-11-21 01:35:07,717 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse0)) (not (bvule .cse0 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse1) (bvule .cse1 (select (store |c_#length| |v_node_create_~temp~0#1.base_57| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_57|))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse2) (bvule .cse2 (select (store |c_#length| |v_node_create_~temp~0#1.base_49| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_49|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse3 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse3)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (or (let ((.cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse4) (bvule .cse4 (select (store |c_#length| |v_node_create_~temp~0#1.base_65| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_65|))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_6| .cse5)) (not (bvule .cse5 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_10|)))))))))) is different from false [2021-11-21 01:35:09,752 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= |c_node_create_~temp~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse2)) (not (bvule .cse2 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse3) (bvule .cse3 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (= (_ bv8 32) (select |c_#length| |c_node_create_~temp~0#1.base|))) is different from false [2021-11-21 01:35:11,771 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (let ((.cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (and (bvule .cse0 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|)) (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse0))) (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2|))) (or (not (bvule .cse1 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_6|))) (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_2| .cse1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|)))))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_48|))))) (let ((.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (or (not (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse2)) (not (bvule .cse2 (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_48| (_ bv8 32)) |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|))))))) (let ((.cse3 (bvadd (_ bv4 32) |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4|))) (and (bvule |v_ULTIMATE.start_sll_circular_create_~last~0#1.offset_BEFORE_CALL_4| .cse3) (bvule .cse3 (select |c_#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_8|)))))) (= |c_node_create_#res#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_node_create_#res#1.base|))) is different from false [2021-11-21 01:35:12,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:35:12,513 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2021-11-21 01:35:12,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-21 01:35:12,514 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2021-11-21 01:35:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:35:12,516 INFO L225 Difference]: With dead ends: 133 [2021-11-21 01:35:12,516 INFO L226 Difference]: Without dead ends: 133 [2021-11-21 01:35:12,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 121 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 62.2s TimeCoverageRelationStatistics Valid=82, Invalid=343, Unknown=23, NotChecked=308, Total=756 [2021-11-21 01:35:12,518 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 6 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 702 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-21 01:35:12,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 878 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 702 Unchecked, 0.7s Time] [2021-11-21 01:35:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-21 01:35:12,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2021-11-21 01:35:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 122 states have internal predecessors, (132), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 01:35:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2021-11-21 01:35:12,550 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 25 [2021-11-21 01:35:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:35:12,552 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2021-11-21 01:35:12,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-21 01:35:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2021-11-21 01:35:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-21 01:35:12,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:35:12,556 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:35:12,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2021-11-21 01:35:12,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-21 01:35:12,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-21 01:35:13,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:35:13,159 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:35:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:35:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash 131514271, now seen corresponding path program 1 times [2021-11-21 01:35:13,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:35:13,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061538427] [2021-11-21 01:35:13,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:35:13,161 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:35:13,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:35:13,161 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:35:13,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-21 01:35:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:35:13,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-21 01:35:13,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:35:13,400 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:35:13,440 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 13 treesize of output 11 [2021-11-21 01:35:13,650 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-21 01:35:13,650 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 24 treesize of output 31 [2021-11-21 01:35:13,851 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:35:13,851 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 39 treesize of output 35 [2021-11-21 01:35:14,060 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:35:14,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 65 [2021-11-21 01:35:15,111 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:35:15,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 61 [2021-11-21 01:35:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:35:15,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:35:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:35:59,227 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:35:59,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061538427] [2021-11-21 01:35:59,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061538427] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:35:59,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [745072357] [2021-11-21 01:35:59,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:35:59,228 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:35:59,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:35:59,229 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:35:59,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-11-21 01:35:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:35:59,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 01:35:59,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:35:59,747 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-21 01:35:59,748 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 14 treesize of output 19 [2021-11-21 01:35:59,984 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:35:59,984 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 21 treesize of output 17 [2021-11-21 01:36:00,244 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-11-21 01:36:00,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 37 [2021-11-21 01:36:00,677 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 01:36:00,678 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 39 treesize of output 33 [2021-11-21 01:36:03,160 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-21 01:36:03,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 65 [2021-11-21 01:36:04,104 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-21 01:36:04,104 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 43 treesize of output 37 [2021-11-21 01:36:04,515 INFO L354 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2021-11-21 01:36:04,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 71 [2021-11-21 01:36:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-21 01:36:05,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:36:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-21 01:36:14,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [745072357] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 01:36:14,462 INFO L186 FreeRefinementEngine]: Found 2 perfect and 2 imperfect interpolant sequences. [2021-11-21 01:36:14,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [10, 10] total 26 [2021-11-21 01:36:14,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348034781] [2021-11-21 01:36:14,463 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 01:36:14,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 01:36:14,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:36:14,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 01:36:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=568, Unknown=19, NotChecked=0, Total=702 [2021-11-21 01:36:14,465 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-21 01:36:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:36:21,629 INFO L93 Difference]: Finished difference Result 176 states and 192 transitions. [2021-11-21 01:36:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-21 01:36:21,630 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2021-11-21 01:36:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:36:21,632 INFO L225 Difference]: With dead ends: 176 [2021-11-21 01:36:21,632 INFO L226 Difference]: Without dead ends: 176 [2021-11-21 01:36:21,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 102 SyntacticMatches, 17 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 57.3s TimeCoverageRelationStatistics Valid=132, Invalid=658, Unknown=22, NotChecked=0, Total=812 [2021-11-21 01:36:21,634 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 85 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:36:21,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 705 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 205 Unchecked, 1.0s Time] [2021-11-21 01:36:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-21 01:36:21,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 126. [2021-11-21 01:36:21,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 78 states have (on average 1.641025641025641) internal successors, (128), 118 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 01:36:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2021-11-21 01:36:21,643 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 37 [2021-11-21 01:36:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:36:21,644 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2021-11-21 01:36:21,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.090909090909091) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-21 01:36:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2021-11-21 01:36:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-21 01:36:21,646 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:36:21,646 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:36:21,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-21 01:36:21,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2021-11-21 01:36:22,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt [2021-11-21 01:36:22,063 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:36:22,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:36:22,063 INFO L85 PathProgramCache]: Analyzing trace with hash 131514272, now seen corresponding path program 1 times [2021-11-21 01:36:22,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:36:22,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637071025] [2021-11-21 01:36:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:36:22,064 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:36:22,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:36:22,065 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:36:22,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-21 01:36:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:36:22,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-21 01:36:22,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:36:22,326 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:36:22,341 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:36:22,399 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 19 treesize of output 17 [2021-11-21 01:36:22,408 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:36:22,750 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:36:22,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-11-21 01:36:22,766 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:36:22,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-11-21 01:36:23,011 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 01:36:23,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-11-21 01:36:23,447 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 01:36:23,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2021-11-21 01:36:24,641 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-21 01:36:24,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 32 [2021-11-21 01:36:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:36:25,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:36:52,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (_ BitVec 32))) (or (and (forall ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store |c_#length| |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|))) (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|))) (exists ((|v_node_create_~temp~0#1.base_106| (_ BitVec 32))) (and (or (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|) (select (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|)))) (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_3|)))) (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|))))) is different from false [2021-11-21 01:37:14,705 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_106| (_ BitVec 32))) (or (not (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|)) (exists ((|v_node_create_~temp~0#1.base_106| (_ BitVec 32)) (|v_node_create_~temp~0#1.base_110| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_110|))) (or (not (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))) (exists ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (not (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store (store |c_old(#length)| |v_node_create_~temp~0#1.base_110| (_ bv8 32)) |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|))))) (bvult |v_node_create_~temp~0#1.base_106| |c_#StackHeapBarrier|))) (and (bvule |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (forall ((|v_node_create_~temp~0#1.base_102| (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|) (select (store (store |c_#length| |v_node_create_~temp~0#1.base_106| (_ bv8 32)) |v_node_create_~temp~0#1.base_102| (_ bv8 32)) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|)))))) is different from true [2021-11-21 01:38:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 18 not checked. [2021-11-21 01:38:15,069 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:38:15,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637071025] [2021-11-21 01:38:15,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637071025] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:38:15,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1122116176] [2021-11-21 01:38:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:38:15,077 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:38:15,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:38:15,080 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:38:15,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-11-21 01:38:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:38:15,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-21 01:38:15,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:38:15,386 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:38:17,167 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:38:17,408 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-21 01:38:17,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 17 [2021-11-21 01:38:17,910 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:38:17,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2021-11-21 01:38:20,485 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 01:38:20,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2021-11-21 01:38:24,151 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:38:24,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2021-11-21 01:38:24,509 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-21 01:38:24,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2021-11-21 01:38:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-21 01:38:25,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:41:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 15 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:41:18,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1122116176] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 01:41:18,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:41:18,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 11, 10] total 34 [2021-11-21 01:41:18,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811108689] [2021-11-21 01:41:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:41:18,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-21 01:41:18,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:41:18,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-21 01:41:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=826, Unknown=76, NotChecked=126, Total=1190 [2021-11-21 01:41:18,149 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:41:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:41:18,485 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2021-11-21 01:41:18,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 01:41:18,486 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-11-21 01:41:18,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:41:18,488 INFO L225 Difference]: With dead ends: 126 [2021-11-21 01:41:18,488 INFO L226 Difference]: Without dead ends: 126 [2021-11-21 01:41:18,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 235.7s TimeCoverageRelationStatistics Valid=162, Invalid=826, Unknown=76, NotChecked=126, Total=1190 [2021-11-21 01:41:18,491 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:41:18,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 444 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 150 Unchecked, 0.3s Time] [2021-11-21 01:41:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-11-21 01:41:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2021-11-21 01:41:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.6282051282051282) internal successors, (127), 117 states have internal predecessors, (127), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 01:41:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2021-11-21 01:41:18,500 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 37 [2021-11-21 01:41:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:41:18,500 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2021-11-21 01:41:18,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:41:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2021-11-21 01:41:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-21 01:41:18,503 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:41:18,503 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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:41:18,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-11-21 01:41:18,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2021-11-21 01:41:18,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt [2021-11-21 01:41:18,923 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:41:18,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:41:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash 931477670, now seen corresponding path program 1 times [2021-11-21 01:41:18,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:41:18,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289232761] [2021-11-21 01:41:18,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:41:18,925 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:41:18,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:41:18,929 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:41:18,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-21 01:41:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:41:19,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-21 01:41:19,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:41:19,482 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:41:20,308 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:41:23,360 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 01:41:23,361 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 66 treesize of output 54 [2021-11-21 01:41:23,442 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-21 01:41:23,443 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 51 treesize of output 62 [2021-11-21 01:41:23,932 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 01:41:23,932 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 62 treesize of output 46 [2021-11-21 01:41:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:41:24,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:41:27,501 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) is different from false [2021-11-21 01:41:30,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) is different from false [2021-11-21 01:41:32,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) is different from false [2021-11-21 01:41:47,621 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 165 treesize of output 157 [2021-11-21 01:41:52,526 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 01:41:52,526 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 98 treesize of output 116 [2021-11-21 01:42:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-21 01:42:00,075 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:42:00,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289232761] [2021-11-21 01:42:00,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289232761] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:42:00,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [476018088] [2021-11-21 01:42:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:42:00,076 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:42:00,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:42:00,077 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:42:00,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2021-11-21 01:42:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:42:00,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-21 01:42:00,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:42:06,941 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:42:16,932 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 15 [2021-11-21 01:42:17,727 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 01:42:17,728 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 61 treesize of output 49 [2021-11-21 01:42:17,831 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-21 01:42:17,831 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 46 treesize of output 57 [2021-11-21 01:42:20,491 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 01:42:20,492 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 51 treesize of output 35 [2021-11-21 01:42:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:42:20,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:43:12,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) is different from false [2021-11-21 01:43:14,999 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))) (_ bv1 1))))) is different from false [2021-11-21 01:43:22,573 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 165 treesize of output 157 [2021-11-21 01:43:28,454 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 01:43:28,455 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 97 treesize of output 115 [2021-11-21 01:43:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 3 times theorem prover too weak. 1 trivial. 3 not checked. [2021-11-21 01:43:31,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [476018088] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:43:31,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183834244] [2021-11-21 01:43:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:43:31,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:43:31,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:43:31,177 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:43:31,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-21 01:43:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:43:31,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-21 01:43:31,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:43:41,124 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 17 treesize of output 13 [2021-11-21 01:43:41,697 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 01:43:41,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 51 [2021-11-21 01:43:41,781 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-21 01:43:41,782 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 48 treesize of output 59 [2021-11-21 01:43:42,277 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 01:43:42,278 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 62 treesize of output 46 [2021-11-21 01:43:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 01:43:42,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:43:45,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))))) is different from false [2021-11-21 01:43:47,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))) (_ bv1 1)) (_ bv0 1)))) is different from false [2021-11-21 01:43:50,175 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|)))))))))) (_ bv1 1))))) is different from false [2021-11-21 01:44:15,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 153 [2021-11-21 01:44:20,299 INFO L354 Elim1Store]: treesize reduction -10, result has 120.4 percent of original size [2021-11-21 01:44:20,299 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 115 treesize of output 163 [2021-11-21 01:44:24,123 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-21 01:44:24,123 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 49 treesize of output 1 [2021-11-21 01:44:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2021-11-21 01:44:24,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183834244] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:44:24,182 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 01:44:24,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17, 16, 17, 16] total 56 [2021-11-21 01:44:24,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553130613] [2021-11-21 01:44:24,183 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 01:44:24,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-11-21 01:44:24,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 01:44:24,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-11-21 01:44:24,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2077, Unknown=52, NotChecked=808, Total=3192 [2021-11-21 01:44:24,186 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 57 states, 52 states have (on average 2.25) internal successors, (117), 50 states have internal predecessors, (117), 8 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2021-11-21 01:44:37,204 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|)))))))))) (_ bv1 1))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) is different from false [2021-11-21 01:44:39,240 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_4)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_8|))))))))))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (store (select |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| (_ bv0 32))) |c_#memory_$Pointer$.base|) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_6)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|)))))))))) (_ bv1 1)) (_ bv0 1)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)))) is different from false [2021-11-21 01:44:41,278 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))))) (bvult (_ bv0 32) |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from false [2021-11-21 01:44:43,379 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.offset| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |c_#valid|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse0 (select (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|) .cse0)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (bvneg (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))) (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_10|))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))))) (bvult (_ bv0 32) |c_#StackHeapBarrier|) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_node_create_#res#1.base|)) (_ bv1 1))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_128| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_118| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_old(#valid)| |v_node_create_~temp~0#1.base_128| (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_128|) |v_node_create_~temp~0#1.offset_118| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_118|) v_DerPreprocessor_1)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)))))))))))) (_ bv1 1)))) (bvult |v_node_create_~temp~0#1.base_128| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_128|)))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))))))) (_ bv1 1))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from false [2021-11-21 01:44:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:44:44,760 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2021-11-21 01:44:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-21 01:44:44,762 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 52 states have (on average 2.25) internal successors, (117), 50 states have internal predecessors, (117), 8 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) Word has length 40 [2021-11-21 01:44:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:44:44,764 INFO L225 Difference]: With dead ends: 155 [2021-11-21 01:44:44,764 INFO L226 Difference]: Without dead ends: 155 [2021-11-21 01:44:44,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 168 SyntacticMatches, 13 SemanticMatches, 66 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 182.8s TimeCoverageRelationStatistics Valid=384, Invalid=2684, Unknown=60, NotChecked=1428, Total=4556 [2021-11-21 01:44:44,767 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 72 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1469 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:44:44,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 1927 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 358 Invalid, 0 Unknown, 1469 Unchecked, 2.3s Time] [2021-11-21 01:44:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-21 01:44:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2021-11-21 01:44:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 86 states have (on average 1.5930232558139534) internal successors, (137), 125 states have internal predecessors, (137), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-21 01:44:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2021-11-21 01:44:44,777 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 40 [2021-11-21 01:44:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:44:44,778 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2021-11-21 01:44:44,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 52 states have (on average 2.25) internal successors, (117), 50 states have internal predecessors, (117), 8 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2021-11-21 01:44:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2021-11-21 01:44:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-21 01:44:44,780 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:44:44,780 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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:44:44,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-21 01:44:45,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2021-11-21 01:44:45,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-21 01:44:45,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:44:45,398 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2021-11-21 01:44:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:44:45,399 INFO L85 PathProgramCache]: Analyzing trace with hash 931477671, now seen corresponding path program 1 times [2021-11-21 01:44:45,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 01:44:45,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976542253] [2021-11-21 01:44:45,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:44:45,400 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 01:44:45,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 01:44:45,401 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 01:44:45,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-21 01:44:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:44:45,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-21 01:44:45,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:44:46,084 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:44:46,141 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:44:48,088 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 34 treesize of output 26 [2021-11-21 01:44:48,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 01:44:52,067 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 01:44:52,068 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 100 treesize of output 88 [2021-11-21 01:44:52,292 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-21 01:44:52,293 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 85 treesize of output 69 [2021-11-21 01:44:52,355 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-11-21 01:44:52,355 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 70 treesize of output 70 [2021-11-21 01:44:52,469 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-21 01:44:52,469 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 60 treesize of output 62 [2021-11-21 01:44:53,421 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 01:44:53,421 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 64 treesize of output 48 [2021-11-21 01:44:53,437 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-21 01:44:53,438 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 42 treesize of output 30 [2021-11-21 01:44:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:44:54,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:45:00,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_160| (_ BitVec 32))) (and (or (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_150| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse0 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_150|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse0 v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_160| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse0 v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)))))) (exists ((|v_node_create_~temp~0#1.offset_150| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse1 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_150|) v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) (bvult |v_node_create_~temp~0#1.base_160| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_160|)))))))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (let ((.cse3 (bvadd .cse2 (_ bv4 32)))) (and (bvule .cse2 .cse3) (bvule .cse3 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)))))))) is different from false [2021-11-21 01:45:10,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_160| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_160| |c_#StackHeapBarrier|) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) v_prenex_1 (_ bv0 32)) (bvadd (_ bv4 32) v_prenex_1) v_prenex_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_150| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_150|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse1 v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_160| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse1 v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_160|)))))))) (and (forall ((v_DerPreprocessor_10 (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse3 (bvadd (_ bv4 32) |c_node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse3 v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse3 v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)))))))) is different from false [2021-11-21 01:45:14,329 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (or (exists ((|v_node_create_~temp~0#1.base_160| (_ BitVec 32))) (and (bvult |v_node_create_~temp~0#1.base_160| |c_#StackHeapBarrier|) (or (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (not (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) v_prenex_1 (_ bv0 32)) (bvadd (_ bv4 32) v_prenex_1) v_prenex_2)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_150| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (not (let ((.cse1 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_150|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse1 v_DerPreprocessor_8)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select (store |c_old(#length)| |v_node_create_~temp~0#1.base_160| (_ bv8 32)) (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_160|) |v_node_create_~temp~0#1.offset_150| (_ bv0 32)) .cse1 v_DerPreprocessor_7)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_node_create_~temp~0#1.base_160|)))))))) (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse2 v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse2 v_DerPreprocessor_9)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|) v_DerPreprocessor_10)) |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_16|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_12|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2021-11-21 01:46:00,199 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 243 treesize of output 235 [2021-11-21 01:46:00,218 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 688 treesize of output 652 [2021-11-21 01:46:23,086 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 19 treesize of output 17 [2021-11-21 01:46:34,613 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 27 treesize of output 25 [2021-11-21 01:46:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-11-21 01:46:34,737 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 01:46:34,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976542253] [2021-11-21 01:46:34,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976542253] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:46:34,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2054448566] [2021-11-21 01:46:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:46:34,738 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 01:46:34,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 01:46:34,740 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 01:46:34,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7620784e-4d51-43aa-9990-8ce2ca2e37cc/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2021-11-21 01:46:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:46:35,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-21 01:46:35,087 INFO L286 TraceCheckSpWp]: Computing forward predicates...