./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan --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 bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan --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 bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 14:47:03,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:47:03,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:47:04,005 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:47:04,005 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:47:04,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:47:04,006 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:47:04,007 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:47:04,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:47:04,008 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:47:04,008 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:47:04,009 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:47:04,009 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:47:04,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:47:04,010 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:47:04,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:47:04,011 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:47:04,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:47:04,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:47:04,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:47:04,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:47:04,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:47:04,015 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:47:04,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:47:04,016 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:47:04,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:47:04,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:47:04,017 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:47:04,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:47:04,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:47:04,018 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:47:04,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:47:04,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:47:04,019 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:47:04,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:47:04,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:47:04,019 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-08 14:47:04,027 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:47:04,027 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:47:04,027 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 14:47:04,027 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 14:47:04,027 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 14:47:04,028 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 14:47:04,028 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 14:47:04,028 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 14:47:04,028 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 14:47:04,028 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 14:47:04,028 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 14:47:04,028 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 14:47:04,028 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 14:47:04,029 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:47:04,029 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:47:04,029 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:47:04,029 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 14:47:04,029 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 14:47:04,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:47:04,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 14:47:04,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:47:04,029 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 14:47:04,029 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 14:47:04,029 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 14:47:04,030 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 14:47:04,030 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 14:47:04,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:47:04,030 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:47:04,030 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 14:47:04,030 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 14:47:04,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:47:04,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:47:04,030 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 14:47:04,030 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 14:47:04,030 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 14:47:04,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 14:47:04,031 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan 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 -> bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 [2018-12-08 14:47:04,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:47:04,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:47:04,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:47:04,057 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:47:04,057 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:47:04,058 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:47:04,092 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/data/d161b9688/c0de74f23b9f46bea2576eb65b7dad63/FLAG7b49ab0ec [2018-12-08 14:47:04,510 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:47:04,511 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/sv-benchmarks/c/list-simple/sll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:47:04,517 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/data/d161b9688/c0de74f23b9f46bea2576eb65b7dad63/FLAG7b49ab0ec [2018-12-08 14:47:04,525 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/data/d161b9688/c0de74f23b9f46bea2576eb65b7dad63 [2018-12-08 14:47:04,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:47:04,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:47:04,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:47:04,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:47:04,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:47:04,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:47:04" (1/1) ... [2018-12-08 14:47:04,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392409d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04, skipping insertion in model container [2018-12-08 14:47:04,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:47:04" (1/1) ... [2018-12-08 14:47:04,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:47:04,555 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:47:04,703 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:47:04,709 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:47:04,781 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:47:04,803 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:47:04,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04 WrapperNode [2018-12-08 14:47:04,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:47:04,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:47:04,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:47:04,804 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:47:04,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04" (1/1) ... [2018-12-08 14:47:04,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04" (1/1) ... [2018-12-08 14:47:04,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:47:04,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:47:04,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:47:04,822 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:47:04,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04" (1/1) ... [2018-12-08 14:47:04,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04" (1/1) ... [2018-12-08 14:47:04,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04" (1/1) ... [2018-12-08 14:47:04,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04" (1/1) ... [2018-12-08 14:47:04,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04" (1/1) ... [2018-12-08 14:47:04,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04" (1/1) ... [2018-12-08 14:47:04,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04" (1/1) ... [2018-12-08 14:47:04,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:47:04,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:47:04,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:47:04,843 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:47:04,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:47:04,874 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 14:47:04,874 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 14:47:04,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:47:04,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 14:47:04,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 14:47:04,874 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-08 14:47:04,874 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-08 14:47:04,874 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_append [2018-12-08 14:47:04,875 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_append [2018-12-08 14:47:04,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 14:47:04,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 14:47:04,875 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 14:47:04,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 14:47:04,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 14:47:04,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 14:47:04,875 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-08 14:47:04,875 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-08 14:47:04,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 14:47:04,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 14:47:04,875 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-08 14:47:04,875 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-08 14:47:04,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:47:04,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:47:05,123 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:47:05,123 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 14:47:05,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:47:05 BoogieIcfgContainer [2018-12-08 14:47:05,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:47:05,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 14:47:05,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 14:47:05,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 14:47:05,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 02:47:04" (1/3) ... [2018-12-08 14:47:05,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737260f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:47:05, skipping insertion in model container [2018-12-08 14:47:05,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:04" (2/3) ... [2018-12-08 14:47:05,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737260f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:47:05, skipping insertion in model container [2018-12-08 14:47:05,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:47:05" (3/3) ... [2018-12-08 14:47:05,129 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:47:05,135 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 14:47:05,140 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-12-08 14:47:05,149 INFO L257 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2018-12-08 14:47:05,166 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 14:47:05,166 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 14:47:05,166 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 14:47:05,166 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:47:05,166 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:47:05,166 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 14:47:05,166 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:47:05,166 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 14:47:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-12-08 14:47:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 14:47:05,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:05,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:05,184 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 14:47:05,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:05,187 INFO L82 PathProgramCache]: Analyzing trace with hash 827174435, now seen corresponding path program 1 times [2018-12-08 14:47:05,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:47:05,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:05,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:47:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:47:05,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:47:05,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:47:05,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:47:05,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:47:05,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:47:05,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:47:05,302 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2018-12-08 14:47:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:05,382 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-12-08 14:47:05,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:47:05,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 14:47:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:05,389 INFO L225 Difference]: With dead ends: 126 [2018-12-08 14:47:05,389 INFO L226 Difference]: Without dead ends: 119 [2018-12-08 14:47:05,390 INFO L631 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 [2018-12-08 14:47:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-08 14:47:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-08 14:47:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-08 14:47:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-12-08 14:47:05,418 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 12 [2018-12-08 14:47:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:05,419 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-12-08 14:47:05,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:47:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-12-08 14:47:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 14:47:05,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:05,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:05,419 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 14:47:05,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash 827174436, now seen corresponding path program 1 times [2018-12-08 14:47:05,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:47:05,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:05,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:47:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:47:05,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:47:05,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:47:05,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:47:05,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:47:05,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:47:05,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:47:05,466 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 3 states. [2018-12-08 14:47:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:05,516 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-12-08 14:47:05,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:47:05,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 14:47:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:05,517 INFO L225 Difference]: With dead ends: 117 [2018-12-08 14:47:05,518 INFO L226 Difference]: Without dead ends: 117 [2018-12-08 14:47:05,518 INFO L631 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 [2018-12-08 14:47:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-08 14:47:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-08 14:47:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-08 14:47:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-12-08 14:47:05,526 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 12 [2018-12-08 14:47:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:05,526 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-12-08 14:47:05,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:47:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-12-08 14:47:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 14:47:05,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:05,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:05,527 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 14:47:05,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:05,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1021865586, now seen corresponding path program 1 times [2018-12-08 14:47:05,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:47:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:05,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:47:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:47:05,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:47:05,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:47:05,583 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:47:05,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:47:05,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:47:05,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:47:05,584 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 6 states. [2018-12-08 14:47:05,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:05,714 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-12-08 14:47:05,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:47:05,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 14:47:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:05,716 INFO L225 Difference]: With dead ends: 121 [2018-12-08 14:47:05,716 INFO L226 Difference]: Without dead ends: 121 [2018-12-08 14:47:05,716 INFO L631 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 [2018-12-08 14:47:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-08 14:47:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-12-08 14:47:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-08 14:47:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2018-12-08 14:47:05,724 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 19 [2018-12-08 14:47:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:05,725 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-12-08 14:47:05,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:47:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2018-12-08 14:47:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 14:47:05,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:05,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:05,726 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 14:47:05,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:05,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1021865585, now seen corresponding path program 1 times [2018-12-08 14:47:05,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:47:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:47:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:47:05,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:47:05,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:47:05,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:47:05,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 14:47:05,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 14:47:05,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 14:47:05,756 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 5 states. [2018-12-08 14:47:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:05,777 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-12-08 14:47:05,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:47:05,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-08 14:47:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:05,778 INFO L225 Difference]: With dead ends: 118 [2018-12-08 14:47:05,779 INFO L226 Difference]: Without dead ends: 118 [2018-12-08 14:47:05,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:47:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-08 14:47:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-08 14:47:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-08 14:47:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-12-08 14:47:05,783 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 19 [2018-12-08 14:47:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:05,783 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-12-08 14:47:05,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 14:47:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-12-08 14:47:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 14:47:05,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:05,784 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:05,784 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 14:47:05,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:05,785 INFO L82 PathProgramCache]: Analyzing trace with hash -941340207, now seen corresponding path program 1 times [2018-12-08 14:47:05,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:47:05,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:05,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:47:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 14:47:05,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:47:05,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:47:05,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:47:05,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:47:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:47:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:47:05,824 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 6 states. [2018-12-08 14:47:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:05,944 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-12-08 14:47:05,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:47:05,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-08 14:47:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:05,945 INFO L225 Difference]: With dead ends: 118 [2018-12-08 14:47:05,945 INFO L226 Difference]: Without dead ends: 118 [2018-12-08 14:47:05,945 INFO L631 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 [2018-12-08 14:47:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-08 14:47:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-12-08 14:47:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-08 14:47:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-12-08 14:47:05,949 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 28 [2018-12-08 14:47:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:05,950 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-12-08 14:47:05,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:47:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-12-08 14:47:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 14:47:05,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:05,950 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:05,950 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 14:47:05,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:05,951 INFO L82 PathProgramCache]: Analyzing trace with hash -941340206, now seen corresponding path program 1 times [2018-12-08 14:47:05,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:47:05,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:05,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:05,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:47:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:47:06,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:47:06,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:47:06,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:47:06,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:47:06,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:47:06,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:47:06,006 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 6 states. [2018-12-08 14:47:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:06,134 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-12-08 14:47:06,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:47:06,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-08 14:47:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:06,135 INFO L225 Difference]: With dead ends: 117 [2018-12-08 14:47:06,135 INFO L226 Difference]: Without dead ends: 117 [2018-12-08 14:47:06,135 INFO L631 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 [2018-12-08 14:47:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-08 14:47:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-12-08 14:47:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-08 14:47:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-12-08 14:47:06,138 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 28 [2018-12-08 14:47:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:06,139 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-12-08 14:47:06,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:47:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-12-08 14:47:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 14:47:06,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:06,139 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:06,139 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 14:47:06,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:06,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1624535076, now seen corresponding path program 1 times [2018-12-08 14:47:06,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:47:06,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:06,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:06,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:06,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:47:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:47:06,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:47:06,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:47:06,265 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-08 14:47:06,267 INFO L205 CegarAbsIntRunner]: [55], [103], [104], [110], [112], [119], [121], [123], [124], [127], [132], [175], [181], [183], [186], [189], [190], [193], [199], [200], [201], [202], [203], [204], [205] [2018-12-08 14:47:06,287 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 14:47:06,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 14:47:06,455 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 14:47:06,456 INFO L272 AbstractInterpreter]: Visited 25 different actions 58 times. Merged at 7 different actions 12 times. Never widened. Performed 643 root evaluator evaluations with a maximum evaluation depth of 3. Performed 643 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-08 14:47:06,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:06,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 14:47:06,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:47:06,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:47:06,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:06,474 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 14:47:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:06,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:06,523 INFO L478 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 [2018-12-08 14:47:06,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:06,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:06,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:47:06,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:06,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:06,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 14:47:06,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:06,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:06,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-08 14:47:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:47:06,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:47:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:47:07,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 14:47:07,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 18 [2018-12-08 14:47:07,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 14:47:07,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 14:47:07,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 14:47:07,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=281, Unknown=2, NotChecked=0, Total=342 [2018-12-08 14:47:07,858 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 13 states. [2018-12-08 14:47:08,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:08,204 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-12-08 14:47:08,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 14:47:08,204 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-12-08 14:47:08,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:08,205 INFO L225 Difference]: With dead ends: 131 [2018-12-08 14:47:08,205 INFO L226 Difference]: Without dead ends: 131 [2018-12-08 14:47:08,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=100, Invalid=404, Unknown=2, NotChecked=0, Total=506 [2018-12-08 14:47:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-08 14:47:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2018-12-08 14:47:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-08 14:47:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-12-08 14:47:08,211 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 31 [2018-12-08 14:47:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:08,211 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-12-08 14:47:08,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 14:47:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-12-08 14:47:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 14:47:08,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:08,212 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:08,212 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 14:47:08,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:08,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1624535075, now seen corresponding path program 1 times [2018-12-08 14:47:08,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:47:08,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:08,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:08,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:08,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:47:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:47:08,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:47:08,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:47:08,294 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-08 14:47:08,295 INFO L205 CegarAbsIntRunner]: [55], [103], [104], [110], [112], [119], [121], [123], [124], [127], [133], [175], [181], [183], [186], [189], [190], [193], [199], [200], [201], [202], [203], [204], [205] [2018-12-08 14:47:08,296 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 14:47:08,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 14:47:08,372 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 14:47:08,372 INFO L272 AbstractInterpreter]: Visited 25 different actions 58 times. Merged at 7 different actions 12 times. Never widened. Performed 649 root evaluator evaluations with a maximum evaluation depth of 3. Performed 649 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-08 14:47:08,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:08,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 14:47:08,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:47:08,373 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:47:08,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:08,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 14:47:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:08,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:08,407 INFO L478 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 [2018-12-08 14:47:08,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:08,412 INFO L478 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 [2018-12-08 14:47:08,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:08,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:08,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 14:47:08,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:08,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:08,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 14:47:08,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:08,507 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 14:47:08,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:08,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:08,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-12-08 14:47:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:47:08,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:47:08,598 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-08 14:47:12,804 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 58 DAG size of output: 22 [2018-12-08 14:47:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:47:13,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 14:47:13,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2018-12-08 14:47:13,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 14:47:13,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 14:47:13,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 14:47:13,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-12-08 14:47:13,007 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 16 states. [2018-12-08 14:47:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:13,382 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-12-08 14:47:13,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 14:47:13,383 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-12-08 14:47:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:13,383 INFO L225 Difference]: With dead ends: 130 [2018-12-08 14:47:13,383 INFO L226 Difference]: Without dead ends: 130 [2018-12-08 14:47:13,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2018-12-08 14:47:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-08 14:47:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 114. [2018-12-08 14:47:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-08 14:47:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-12-08 14:47:13,386 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 31 [2018-12-08 14:47:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:13,386 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-12-08 14:47:13,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 14:47:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-12-08 14:47:13,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 14:47:13,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:13,387 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:13,387 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 14:47:13,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1935662167, now seen corresponding path program 1 times [2018-12-08 14:47:13,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:47:13,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:13,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:13,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:47:13,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:47:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 14:47:13,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:47:13,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 14:47:13,523 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-12-08 14:47:13,523 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [55], [57], [103], [104], [110], [112], [119], [121], [123], [124], [127], [131], [134], [135], [175], [181], [183], [186], [189], [190], [191], [192], [193], [194], [195], [199], [200], [201], [202], [203], [204], [205] [2018-12-08 14:47:13,525 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 14:47:13,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 14:47:13,588 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 14:47:13,588 INFO L272 AbstractInterpreter]: Visited 35 different actions 77 times. Merged at 9 different actions 14 times. Never widened. Performed 829 root evaluator evaluations with a maximum evaluation depth of 3. Performed 829 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-12-08 14:47:13,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:13,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 14:47:13,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:47:13,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:47:13,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:13,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 14:47:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:13,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:13,630 INFO L478 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 [2018-12-08 14:47:13,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:13,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:13,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:47:13,913 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (= (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) |c_#valid|)) is different from true [2018-12-08 14:47:15,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:15,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:15,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-08 14:47:15,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-08 14:47:15,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:15,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:15,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:15,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-12-08 14:47:15,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-08 14:47:15,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:15,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:16,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-12-08 14:47:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2018-12-08 14:47:16,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:47:22,609 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_node_create_#t~malloc2.base_36| Int) (|v_main_~#s~0.base_BEFORE_CALL_3| Int)) (or (exists ((|v_node_create_#t~malloc2.base_33| Int) (|v_node_create_#t~malloc2.base_32| Int)) (and (not (= (select (store (store |c_old(#valid)| |v_node_create_#t~malloc2.base_33| 1) |v_node_create_#t~malloc2.base_32| 1) |v_main_~#s~0.base_BEFORE_CALL_3|) 1)) (= (select |c_old(#valid)| |v_node_create_#t~malloc2.base_33|) 0))) (= (select (store |c_#valid| |v_node_create_#t~malloc2.base_36| 1) |v_main_~#s~0.base_BEFORE_CALL_3|) 1))) is different from false [2018-12-08 14:47:22,816 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:47:22,817 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 25527 column 11: unknown constant v_node_create_#t~malloc2.base_33 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:114) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:120) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.checkEqualityStatus(Elim1Store.java:668) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:760) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-08 14:47:22,824 INFO L168 Benchmark]: Toolchain (without parser) took 18296.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 948.1 MB in the beginning and 1.3 GB in the end (delta: -313.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:47:22,825 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:47:22,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-08 14:47:22,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:47:22,828 INFO L168 Benchmark]: Boogie Preprocessor took 20.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-08 14:47:22,829 INFO L168 Benchmark]: RCFGBuilder took 280.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. [2018-12-08 14:47:22,830 INFO L168 Benchmark]: TraceAbstraction took 17698.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -186.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:47:22,836 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 280.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17698.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -186.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 25527 column 11: unknown constant v_node_create_#t~malloc2.base_33 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 25527 column 11: unknown constant v_node_create_#t~malloc2.base_33: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 14:47:24,135 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:47:24,136 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:47:24,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:47:24,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:47:24,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:47:24,143 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:47:24,144 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:47:24,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:47:24,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:47:24,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:47:24,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:47:24,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:47:24,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:47:24,147 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:47:24,148 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:47:24,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:47:24,149 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:47:24,150 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:47:24,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:47:24,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:47:24,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:47:24,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:47:24,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:47:24,153 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:47:24,153 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:47:24,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:47:24,154 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:47:24,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:47:24,155 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:47:24,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:47:24,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:47:24,156 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:47:24,156 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:47:24,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:47:24,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:47:24,157 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-08 14:47:24,164 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:47:24,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:47:24,165 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 14:47:24,165 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 14:47:24,165 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 14:47:24,165 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 14:47:24,165 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 14:47:24,165 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 14:47:24,165 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 14:47:24,165 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 14:47:24,166 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:47:24,166 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:47:24,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:47:24,166 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 14:47:24,166 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 14:47:24,166 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:47:24,166 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 14:47:24,166 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:47:24,166 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 14:47:24,167 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 14:47:24,167 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 14:47:24,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 14:47:24,167 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 14:47:24,167 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 14:47:24,167 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 14:47:24,167 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 14:47:24,167 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:47:24,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:47:24,167 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 14:47:24,167 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 14:47:24,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:47:24,168 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:47:24,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 14:47:24,168 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 14:47:24,168 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 14:47:24,168 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 14:47:24,168 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan 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 -> bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 [2018-12-08 14:47:24,186 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:47:24,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:47:24,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:47:24,200 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:47:24,200 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:47:24,201 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:47:24,241 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/data/0e8438140/a9e94e6fde8448cd997b9237f141b4d8/FLAGc33cf5475 [2018-12-08 14:47:24,694 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:47:24,694 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/sv-benchmarks/c/list-simple/sll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:47:24,700 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/data/0e8438140/a9e94e6fde8448cd997b9237f141b4d8/FLAGc33cf5475 [2018-12-08 14:47:24,707 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/data/0e8438140/a9e94e6fde8448cd997b9237f141b4d8 [2018-12-08 14:47:24,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:47:24,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:47:24,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:47:24,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:47:24,713 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:47:24,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:47:24" (1/1) ... [2018-12-08 14:47:24,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33327ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24, skipping insertion in model container [2018-12-08 14:47:24,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:47:24" (1/1) ... [2018-12-08 14:47:24,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:47:24,736 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:47:24,893 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:47:24,901 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:47:24,974 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:47:24,997 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:47:24,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24 WrapperNode [2018-12-08 14:47:24,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:47:24,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:47:24,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:47:24,999 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:47:25,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24" (1/1) ... [2018-12-08 14:47:25,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24" (1/1) ... [2018-12-08 14:47:25,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:47:25,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:47:25,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:47:25,018 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:47:25,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24" (1/1) ... [2018-12-08 14:47:25,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24" (1/1) ... [2018-12-08 14:47:25,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24" (1/1) ... [2018-12-08 14:47:25,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24" (1/1) ... [2018-12-08 14:47:25,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24" (1/1) ... [2018-12-08 14:47:25,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24" (1/1) ... [2018-12-08 14:47:25,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24" (1/1) ... [2018-12-08 14:47:25,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:47:25,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:47:25,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:47:25,040 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:47:25,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:47:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 14:47:25,071 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 14:47:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:47:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-08 14:47:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-08 14:47:25,071 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-08 14:47:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_append [2018-12-08 14:47:25,071 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_append [2018-12-08 14:47:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 14:47:25,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 14:47:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 14:47:25,072 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 14:47:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 14:47:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 14:47:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-08 14:47:25,072 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-08 14:47:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 14:47:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-08 14:47:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 14:47:25,073 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-08 14:47:25,073 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-08 14:47:25,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:47:25,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:47:25,415 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:47:25,415 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 14:47:25,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:47:25 BoogieIcfgContainer [2018-12-08 14:47:25,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:47:25,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 14:47:25,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 14:47:25,418 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 14:47:25,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 02:47:24" (1/3) ... [2018-12-08 14:47:25,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173dc7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:47:25, skipping insertion in model container [2018-12-08 14:47:25,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:47:24" (2/3) ... [2018-12-08 14:47:25,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173dc7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:47:25, skipping insertion in model container [2018-12-08 14:47:25,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:47:25" (3/3) ... [2018-12-08 14:47:25,420 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:47:25,425 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 14:47:25,430 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-12-08 14:47:25,440 INFO L257 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2018-12-08 14:47:25,454 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 14:47:25,455 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 14:47:25,455 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 14:47:25,455 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 14:47:25,455 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:47:25,455 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:47:25,455 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 14:47:25,455 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:47:25,455 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 14:47:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-12-08 14:47:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 14:47:25,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:25,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:25,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:47:25,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:25,475 INFO L82 PathProgramCache]: Analyzing trace with hash 827174435, now seen corresponding path program 1 times [2018-12-08 14:47:25,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:47:25,477 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:47:25,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:25,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:25,558 INFO L478 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 [2018-12-08 14:47:25,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:25,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:25,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:47:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:47:25,571 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 14:47:25,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:47:25,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:47:25,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:47:25,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:47:25,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:47:25,585 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2018-12-08 14:47:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:25,744 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-12-08 14:47:25,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:47:25,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 14:47:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:25,752 INFO L225 Difference]: With dead ends: 126 [2018-12-08 14:47:25,752 INFO L226 Difference]: Without dead ends: 119 [2018-12-08 14:47:25,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:47:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-08 14:47:25,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-08 14:47:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-08 14:47:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-12-08 14:47:25,781 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 12 [2018-12-08 14:47:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:25,781 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-12-08 14:47:25,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:47:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-12-08 14:47:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 14:47:25,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:25,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:25,782 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:47:25,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:25,783 INFO L82 PathProgramCache]: Analyzing trace with hash 827174436, now seen corresponding path program 1 times [2018-12-08 14:47:25,783 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:47:25,783 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:47:25,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:25,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:25,844 INFO L478 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 [2018-12-08 14:47:25,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:25,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:25,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 14:47:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:47:25,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 14:47:25,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:47:25,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:47:25,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:47:25,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:47:25,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:47:25,862 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 3 states. [2018-12-08 14:47:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:26,033 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-12-08 14:47:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:47:26,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 14:47:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:26,035 INFO L225 Difference]: With dead ends: 117 [2018-12-08 14:47:26,035 INFO L226 Difference]: Without dead ends: 117 [2018-12-08 14:47:26,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:47:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-08 14:47:26,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-08 14:47:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-08 14:47:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-12-08 14:47:26,041 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 12 [2018-12-08 14:47:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:26,041 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-12-08 14:47:26,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:47:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-12-08 14:47:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 14:47:26,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:26,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:26,042 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:47:26,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:26,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1021865586, now seen corresponding path program 1 times [2018-12-08 14:47:26,042 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:47:26,042 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:47:26,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:26,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:47:26,115 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 14:47:26,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:47:26,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:47:26,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 14:47:26,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 14:47:26,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 14:47:26,118 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 5 states. [2018-12-08 14:47:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:26,148 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-12-08 14:47:26,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:47:26,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-08 14:47:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:26,149 INFO L225 Difference]: With dead ends: 124 [2018-12-08 14:47:26,149 INFO L226 Difference]: Without dead ends: 124 [2018-12-08 14:47:26,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:47:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-08 14:47:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2018-12-08 14:47:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-08 14:47:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-12-08 14:47:26,155 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 19 [2018-12-08 14:47:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:26,156 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-12-08 14:47:26,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 14:47:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-12-08 14:47:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 14:47:26,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:26,156 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:26,156 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:47:26,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash -941340207, now seen corresponding path program 1 times [2018-12-08 14:47:26,157 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:47:26,157 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:47:26,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:26,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:26,234 INFO L478 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 [2018-12-08 14:47:26,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:26,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:26,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:47:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:47:26,258 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 14:47:26,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:47:26,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:47:26,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:47:26,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:47:26,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:47:26,261 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 6 states. [2018-12-08 14:47:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:26,619 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-12-08 14:47:26,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:47:26,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-08 14:47:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:26,622 INFO L225 Difference]: With dead ends: 118 [2018-12-08 14:47:26,622 INFO L226 Difference]: Without dead ends: 118 [2018-12-08 14:47:26,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:47:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-08 14:47:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-12-08 14:47:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-08 14:47:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-12-08 14:47:26,627 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 28 [2018-12-08 14:47:26,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:26,627 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-12-08 14:47:26,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:47:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-12-08 14:47:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 14:47:26,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:26,628 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:26,628 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:47:26,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash -941340206, now seen corresponding path program 1 times [2018-12-08 14:47:26,629 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:47:26,629 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:47:26,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:26,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:26,719 INFO L478 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 [2018-12-08 14:47:26,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:26,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:26,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 14:47:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:47:26,762 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 14:47:26,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:47:26,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:47:26,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:47:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:47:26,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:47:26,764 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 6 states. [2018-12-08 14:47:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:27,161 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-12-08 14:47:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:47:27,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-08 14:47:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:27,162 INFO L225 Difference]: With dead ends: 117 [2018-12-08 14:47:27,162 INFO L226 Difference]: Without dead ends: 117 [2018-12-08 14:47:27,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:47:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-08 14:47:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-12-08 14:47:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-08 14:47:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-12-08 14:47:27,166 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 28 [2018-12-08 14:47:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:27,166 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-12-08 14:47:27,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:47:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-12-08 14:47:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 14:47:27,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:27,167 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:27,167 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:47:27,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:27,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1624535076, now seen corresponding path program 1 times [2018-12-08 14:47:27,168 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:47:27,168 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:47:27,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:27,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:27,257 INFO L478 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 [2018-12-08 14:47:27,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:27,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:27,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:47:27,591 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-08 14:47:27,600 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-08 14:47:27,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:27,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:27,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 14:47:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-08 14:47:27,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:47:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 4 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:47:27,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:47:27,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:47:27,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:27,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:27,770 INFO L478 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 [2018-12-08 14:47:27,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:27,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:27,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:47:29,782 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-08 14:47:29,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:29,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:29,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 14:47:29,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:29,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:29,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-08 14:47:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-08 14:47:29,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:47:29,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 14:47:29,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 10 [2018-12-08 14:47:29,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 14:47:29,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 14:47:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=66, Unknown=7, NotChecked=34, Total=132 [2018-12-08 14:47:29,889 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 11 states. [2018-12-08 14:47:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:32,652 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-12-08 14:47:32,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 14:47:32,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-12-08 14:47:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:32,653 INFO L225 Difference]: With dead ends: 131 [2018-12-08 14:47:32,653 INFO L226 Difference]: Without dead ends: 131 [2018-12-08 14:47:32,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=44, Invalid=135, Unknown=11, NotChecked=50, Total=240 [2018-12-08 14:47:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-08 14:47:32,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2018-12-08 14:47:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-08 14:47:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-12-08 14:47:32,657 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 31 [2018-12-08 14:47:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:32,657 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-12-08 14:47:32,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 14:47:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-12-08 14:47:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 14:47:32,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:32,658 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:32,658 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:47:32,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1624535075, now seen corresponding path program 1 times [2018-12-08 14:47:32,658 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:47:32,659 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:47:32,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:32,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:32,766 INFO L478 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 [2018-12-08 14:47:32,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:32,774 INFO L478 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 [2018-12-08 14:47:32,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:32,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:32,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 14:47:33,597 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-12-08 14:47:33,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:33,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:33,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-08 14:47:33,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:33,618 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 14:47:33,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:33,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:33,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2018-12-08 14:47:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-08 14:47:33,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:47:33,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:47:33,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:47:33,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:33,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:33,829 INFO L478 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 [2018-12-08 14:47:33,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:33,838 INFO L478 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 [2018-12-08 14:47:33,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:33,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:33,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 14:47:33,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:33,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:33,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-08 14:47:33,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:33,870 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 14:47:33,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:33,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:33,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2018-12-08 14:47:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-08 14:47:33,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:47:33,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:47:33,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-08 14:47:33,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 14:47:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 14:47:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2018-12-08 14:47:33,981 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 9 states. [2018-12-08 14:47:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:47:34,886 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-12-08 14:47:34,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 14:47:34,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-12-08 14:47:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:47:34,887 INFO L225 Difference]: With dead ends: 130 [2018-12-08 14:47:34,887 INFO L226 Difference]: Without dead ends: 130 [2018-12-08 14:47:34,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2018-12-08 14:47:34,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-08 14:47:34,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 114. [2018-12-08 14:47:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-08 14:47:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-12-08 14:47:34,891 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 31 [2018-12-08 14:47:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:47:34,891 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-12-08 14:47:34,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 14:47:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-12-08 14:47:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 14:47:34,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:47:34,892 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:47:34,892 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:47:34,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:47:34,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1935662167, now seen corresponding path program 1 times [2018-12-08 14:47:34,893 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:47:34,893 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:47:34,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:35,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:35,068 INFO L478 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 [2018-12-08 14:47:35,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:35,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:35,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:47:35,630 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-08 14:47:36,236 WARN L180 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-08 14:47:36,630 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-08 14:47:38,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:38,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:38,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-08 14:47:38,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-08 14:47:38,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:38,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:38,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:38,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-08 14:47:38,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 14:47:38,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:38,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:38,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-12-08 14:47:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 9 trivial. 12 not checked. [2018-12-08 14:47:38,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:47:46,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:47:46,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:47:46,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:47:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:47:46,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:47:46,384 INFO L478 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 [2018-12-08 14:47:46,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:46,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:46,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:47:48,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:48,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:47:48,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-08 14:47:48,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-08 14:47:48,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:48,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:47:48,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:48,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-08 14:47:48,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 14:47:48,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:47:48,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:47:48,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-12-08 14:47:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 9 trivial. 12 not checked. [2018-12-08 14:47:48,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:48:00,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:48:00,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2018-12-08 14:48:00,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 14:48:00,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 14:48:00,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=116, Unknown=13, NotChecked=46, Total=210 [2018-12-08 14:48:00,169 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 11 states. [2018-12-08 14:48:13,398 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))) is different from true [2018-12-08 14:48:35,653 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-08 14:48:36,370 WARN L180 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-08 14:50:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:50:23,800 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2018-12-08 14:50:23,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 14:50:23,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-12-08 14:50:23,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:50:23,802 INFO L225 Difference]: With dead ends: 175 [2018-12-08 14:50:23,802 INFO L226 Difference]: Without dead ends: 175 [2018-12-08 14:50:23,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=58, Invalid=176, Unknown=18, NotChecked=90, Total=342 [2018-12-08 14:50:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-08 14:50:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 143. [2018-12-08 14:50:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-08 14:50:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2018-12-08 14:50:23,807 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 47 [2018-12-08 14:50:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:50:23,807 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2018-12-08 14:50:23,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 14:50:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2018-12-08 14:50:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 14:50:23,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:50:23,809 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:50:23,809 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:50:23,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:50:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1935662166, now seen corresponding path program 1 times [2018-12-08 14:50:23,809 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:50:23,810 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:50:23,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:50:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:50:23,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:50:24,002 INFO L478 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 [2018-12-08 14:50:24,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:50:24,016 INFO L478 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 [2018-12-08 14:50:24,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:50:24,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:50:24,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 14:50:26,087 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| sll_circular_create_~last~0.base (_ bv1 1))) (= |c_#length| (store |c_old(#length)| sll_circular_create_~last~0.base (_ bv8 32))) (= (select |c_old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))) is different from true [2018-12-08 14:50:33,571 WARN L180 SmtUtils]: Spent 875.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-08 14:50:35,231 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_create_~last~0.base (_ BitVec 32)) (sll_circular_create_~new_head~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~new_head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| sll_circular_create_~last~0.base (_ bv8 32)) sll_circular_create_~new_head~0.base (_ bv8 32))) (= (select |c_old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))) is different from true [2018-12-08 14:50:35,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:50:35,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:50:35,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:50:35,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 14:50:35,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:50:35,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:50:35,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-08 14:50:35,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 36 [2018-12-08 14:50:35,301 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:50:35,316 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:50:35,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:50:35,333 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:25 [2018-12-08 14:50:42,003 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)))) is different from true [2018-12-08 14:50:42,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:50:42,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:50:42,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:50:42,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 37 [2018-12-08 14:50:42,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-08 14:50:42,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-08 14:50:42,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:60 [2018-12-08 14:50:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2018-12-08 14:50:44,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:50:46,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:50:46,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:50:46,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:50:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:50:46,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:50:46,337 INFO L478 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 [2018-12-08 14:50:46,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:50:46,344 INFO L478 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 [2018-12-08 14:50:46,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:50:46,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:50:46,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 14:50:47,118 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-08 14:50:47,939 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-12-08 14:50:49,892 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_11 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_11) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_11 (_ bv1 1)) |node_create_#t~malloc2.base|)) (= |c_#length| (store (store |c_old(#length)| v_prenex_11 (_ bv8 32)) |node_create_#t~malloc2.base| (_ bv8 32))))) is different from true [2018-12-08 14:50:49,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:50:49,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:50:49,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:50:49,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 14:50:49,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:50:49,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:50:49,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-08 14:50:49,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-08 14:50:49,951 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:50:49,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:50:49,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:50:49,969 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-12-08 14:51:11,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:51:11,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:51:11,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:51:11,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-08 14:51:11,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-08 14:51:11,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-12-08 14:51:11,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:90 [2018-12-08 14:51:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 19 not checked. [2018-12-08 14:51:11,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:51:13,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:51:13,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 23 [2018-12-08 14:51:13,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-08 14:51:13,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-08 14:51:13,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=312, Unknown=25, NotChecked=246, Total=650 [2018-12-08 14:51:13,410 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand 24 states. [2018-12-08 14:51:23,672 WARN L180 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-08 14:51:29,714 WARN L180 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2018-12-08 14:51:48,790 WARN L180 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 39 DAG size of output: 16 [2018-12-08 14:52:03,311 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_11 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_11) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_11 (_ bv1 1)) |node_create_#t~malloc2.base|)) (= |c_#length| (store (store |c_old(#length)| v_prenex_11 (_ bv8 32)) |node_create_#t~malloc2.base| (_ bv8 32))))) (exists ((sll_circular_create_~last~0.base (_ BitVec 32)) (sll_circular_create_~new_head~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~new_head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| sll_circular_create_~last~0.base (_ bv8 32)) sll_circular_create_~new_head~0.base (_ bv8 32))) (= (select |c_old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1))))) is different from true [2018-12-08 14:52:23,277 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 50 [2018-12-08 14:53:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:53:44,113 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2018-12-08 14:53:44,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 14:53:44,114 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-12-08 14:53:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:53:44,115 INFO L225 Difference]: With dead ends: 169 [2018-12-08 14:53:44,115 INFO L226 Difference]: Without dead ends: 169 [2018-12-08 14:53:44,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 92.0s TimeCoverageRelationStatistics Valid=125, Invalid=565, Unknown=40, NotChecked=392, Total=1122 [2018-12-08 14:53:44,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-08 14:53:44,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2018-12-08 14:53:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-08 14:53:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 165 transitions. [2018-12-08 14:53:44,118 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 165 transitions. Word has length 47 [2018-12-08 14:53:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:53:44,119 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 165 transitions. [2018-12-08 14:53:44,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-08 14:53:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2018-12-08 14:53:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 14:53:44,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:53:44,120 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:53:44,120 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:53:44,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:53:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash -450504022, now seen corresponding path program 1 times [2018-12-08 14:53:44,120 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:53:44,120 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:53:44,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:53:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:53:44,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:53:44,236 INFO L478 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 [2018-12-08 14:53:44,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:44,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:53:44,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:53:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 14:53:44,259 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 14:53:44,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:53:44,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:53:44,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:53:44,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:53:44,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:53:44,261 INFO L87 Difference]: Start difference. First operand 143 states and 165 transitions. Second operand 6 states. [2018-12-08 14:53:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:53:44,576 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2018-12-08 14:53:44,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:53:44,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-12-08 14:53:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:53:44,577 INFO L225 Difference]: With dead ends: 141 [2018-12-08 14:53:44,577 INFO L226 Difference]: Without dead ends: 141 [2018-12-08 14:53:44,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:53:44,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-08 14:53:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-08 14:53:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-08 14:53:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2018-12-08 14:53:44,581 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 49 [2018-12-08 14:53:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:53:44,581 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2018-12-08 14:53:44,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:53:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2018-12-08 14:53:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 14:53:44,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:53:44,582 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:53:44,582 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:53:44,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:53:44,582 INFO L82 PathProgramCache]: Analyzing trace with hash -450504021, now seen corresponding path program 1 times [2018-12-08 14:53:44,582 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:53:44,583 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:53:44,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:53:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:53:44,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:53:44,706 INFO L478 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 [2018-12-08 14:53:44,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:44,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:53:44,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 14:53:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 14:53:44,738 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 14:53:44,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:53:44,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:53:44,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:53:44,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:53:44,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:53:44,741 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand 6 states. [2018-12-08 14:53:45,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:53:45,096 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2018-12-08 14:53:45,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:53:45,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-12-08 14:53:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:53:45,097 INFO L225 Difference]: With dead ends: 139 [2018-12-08 14:53:45,097 INFO L226 Difference]: Without dead ends: 139 [2018-12-08 14:53:45,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:53:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-08 14:53:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-08 14:53:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-08 14:53:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2018-12-08 14:53:45,101 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 49 [2018-12-08 14:53:45,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:53:45,101 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2018-12-08 14:53:45,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:53:45,101 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2018-12-08 14:53:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 14:53:45,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:53:45,102 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:53:45,102 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:53:45,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:53:45,102 INFO L82 PathProgramCache]: Analyzing trace with hash 857577455, now seen corresponding path program 1 times [2018-12-08 14:53:45,103 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:53:45,103 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:53:45,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:53:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:53:45,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:53:45,254 INFO L478 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 [2018-12-08 14:53:45,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:45,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:53:45,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:53:45,415 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 14:53:45,418 INFO L478 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 8 treesize of output 7 [2018-12-08 14:53:45,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:45,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:53:45,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:53:45,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-12-08 14:53:45,501 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-08 14:53:45,507 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:53:45,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:45,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:53:45,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:53:45,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:37 [2018-12-08 14:53:49,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:53:49,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:53:49,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-12-08 14:53:49,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:49,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2018-12-08 14:53:49,689 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-12-08 14:53:49,693 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:53:49,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:49,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:53:49,761 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-12-08 14:53:49,765 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:53:49,765 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:49,771 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:53:49,792 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:53:49,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 14:53:49,813 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:49, output treesize:75 [2018-12-08 14:53:51,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2018-12-08 14:53:51,917 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-12-08 14:53:51,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:51,959 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-12-08 14:53:51,959 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:51,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 14:53:52,047 INFO L478 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 48 treesize of output 44 [2018-12-08 14:53:52,049 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-08 14:53:52,049 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:52,060 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:53:52,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-08 14:53:52,106 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:105, output treesize:129 [2018-12-08 14:53:56,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-12-08 14:53:56,358 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-08 14:53:56,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:53:56,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:53:56,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:53:56,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:17 [2018-12-08 14:53:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:53:56,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:54:00,840 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-08 14:54:01,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:01,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:01,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:01,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:54:01,554 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:01,572 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:01,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-12-08 14:54:01,650 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-12-08 14:54:01,658 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-08 14:54:01,658 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:01,668 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:54:01,702 INFO L478 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 24 treesize of output 26 [2018-12-08 14:54:01,705 INFO L478 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 21 treesize of output 19 [2018-12-08 14:54:01,705 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:01,744 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 14:54:01,745 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-08 14:54:01,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-08 14:54:01,776 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:01,793 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 14:54:01,816 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 14:54:01,951 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:01,962 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:02,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-12-08 14:54:02,025 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:133, output treesize:151 [2018-12-08 14:54:22,096 WARN L180 SmtUtils]: Spent 8.36 s on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2018-12-08 14:54:22,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:54:22,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:54:22,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:54:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:54:22,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:54:22,203 INFO L478 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 [2018-12-08 14:54:22,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:22,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:54:22,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:54:22,694 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-08 14:54:22,701 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 14:54:22,703 INFO L478 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 8 treesize of output 7 [2018-12-08 14:54:22,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:22,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:54:22,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:22,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-12-08 14:54:25,470 WARN L180 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-08 14:54:25,483 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-08 14:54:25,492 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:54:25,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:25,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:54:25,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:25,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2018-12-08 14:54:37,698 WARN L180 SmtUtils]: Spent 892.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-08 14:54:37,708 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-08 14:54:37,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:37,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2018-12-08 14:54:37,775 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2018-12-08 14:54:37,780 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:54:37,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:37,786 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:54:37,846 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2018-12-08 14:54:37,851 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:54:37,851 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:37,858 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:37,875 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:54:37,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:54:37,896 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:44, output treesize:61 [2018-12-08 14:54:40,202 INFO L478 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 41 treesize of output 45 [2018-12-08 14:54:40,205 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-12-08 14:54:40,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:40,235 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-12-08 14:54:40,235 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:40,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 14:54:40,301 INFO L478 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 37 treesize of output 33 [2018-12-08 14:54:40,303 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-08 14:54:40,303 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:40,312 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:54:40,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-08 14:54:40,347 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:79, output treesize:88 [2018-12-08 14:54:43,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-08 14:54:43,985 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 14:54:43,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:43,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:54:43,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:54:43,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2018-12-08 14:54:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:54:43,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:54:44,242 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-08 14:54:44,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:44,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:54:44,516 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:44,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:44,693 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:44,715 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:44,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-12-08 14:54:44,801 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-12-08 14:54:44,809 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-08 14:54:44,809 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:44,822 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:54:44,871 INFO L478 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 24 treesize of output 26 [2018-12-08 14:54:44,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-12-08 14:54:44,879 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:44,937 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 14:54:44,938 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-08 14:54:44,971 INFO L478 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 9 treesize of output 7 [2018-12-08 14:54:44,972 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 14:54:45,001 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 14:54:45,035 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 14:54:45,136 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:45,150 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:45,151 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:45,170 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:45,171 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:45,179 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:54:45,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-12-08 14:54:45,273 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 10 variables, input treesize:117, output treesize:129 [2018-12-08 14:55:06,473 WARN L180 SmtUtils]: Spent 14.76 s on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2018-12-08 14:55:06,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:55:06,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 30 [2018-12-08 14:55:06,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-08 14:55:06,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-08 14:55:06,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1127, Unknown=19, NotChecked=0, Total=1260 [2018-12-08 14:55:06,490 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand 31 states. [2018-12-08 14:55:18,836 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 60 [2018-12-08 14:55:24,319 WARN L180 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2018-12-08 14:55:28,759 WARN L180 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-12-08 14:55:33,238 WARN L180 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-12-08 14:55:39,804 WARN L180 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-12-08 14:55:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:55:57,380 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2018-12-08 14:55:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 14:55:57,380 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-12-08 14:55:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:55:57,381 INFO L225 Difference]: With dead ends: 159 [2018-12-08 14:55:57,381 INFO L226 Difference]: Without dead ends: 159 [2018-12-08 14:55:57,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 99.0s TimeCoverageRelationStatistics Valid=229, Invalid=2005, Unknown=22, NotChecked=0, Total=2256 [2018-12-08 14:55:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-08 14:55:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2018-12-08 14:55:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-08 14:55:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2018-12-08 14:55:57,384 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 51 [2018-12-08 14:55:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:55:57,384 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2018-12-08 14:55:57,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-08 14:55:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2018-12-08 14:55:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 14:55:57,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:55:57,385 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:55:57,385 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:55:57,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:55:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 857577456, now seen corresponding path program 1 times [2018-12-08 14:55:57,385 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:55:57,385 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:55:57,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:55:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:55:57,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:55:57,608 INFO L478 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 [2018-12-08 14:55:57,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:55:57,616 INFO L478 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 [2018-12-08 14:55:57,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:55:57,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:55:57,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 14:55:59,972 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv8 32))) (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.offset|))) is different from true [2018-12-08 14:55:59,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:55:59,990 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 14:55:59,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:56:00,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:56:00,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-08 14:56:00,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2018-12-08 14:56:00,194 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2018-12-08 14:56:00,201 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:56:00,201 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,308 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-12-08 14:56:00,314 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:56:00,314 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,331 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:00,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:56:00,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2018-12-08 14:56:00,493 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-12-08 14:56:00,498 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:56:00,498 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,507 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,550 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 14:56:00,578 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:76, output treesize:80 [2018-12-08 14:56:00,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:56:00,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 14:56:00,923 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 14:56:00,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:56:00,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:56:00,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 40 treesize of output 38 [2018-12-08 14:56:00,957 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-12-08 14:56:00,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-08 14:56:00,969 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:56:00,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:00,988 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:68, output treesize:24 [2018-12-08 14:56:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-08 14:56:01,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:56:01,830 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-08 14:56:02,009 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-08 14:56:02,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:02,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:17,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:56:17,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:56:25,841 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:25,874 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:35,564 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:35,589 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:38,582 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:38,605 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:43,116 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:43,137 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:46,284 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:46,321 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:48,814 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:48,845 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:50,663 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 14:56:50,672 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:56:51,818 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:51,851 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:52,649 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:52,660 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:53,260 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:53,292 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:56:53,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-2 vars, End of recursive call: 16 dim-0 vars, and 6 xjuncts. [2018-12-08 14:56:53,736 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 18 variables, input treesize:389, output treesize:301 [2018-12-08 14:57:01,882 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 135 DAG size of output: 90 [2018-12-08 14:57:01,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:57:01,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:57:01,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:57:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:57:01,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:57:02,068 INFO L478 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 [2018-12-08 14:57:02,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:02,075 INFO L478 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 [2018-12-08 14:57:02,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:02,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:57:02,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 14:57:03,184 WARN L180 SmtUtils]: Spent 973.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-08 14:57:07,381 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-12-08 14:57:09,401 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.offset|))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1))))) is different from true [2018-12-08 14:57:09,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:57:09,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:57:09,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-08 14:57:09,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:09,487 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-08 14:57:09,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:09,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2018-12-08 14:57:09,604 INFO L478 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 0 case distinctions, treesize of input 24 treesize of output 21 [2018-12-08 14:57:09,611 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:57:09,612 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:09,623 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:57:09,686 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-12-08 14:57:09,693 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:57:09,693 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:09,704 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:57:09,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:57:09,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48 [2018-12-08 14:57:09,809 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2018-12-08 14:57:09,814 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:57:09,814 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:09,823 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:57:09,889 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-12-08 14:57:09,893 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:57:09,893 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:09,901 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:09,933 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:57:09,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:57:09,966 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:78, output treesize:84 [2018-12-08 14:57:10,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:57:10,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 14:57:10,501 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 14:57:10,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:10,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:57:10,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:57:10,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:57:10,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2018-12-08 14:57:10,537 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-12-08 14:57:10,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:10,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-12-08 14:57:10,551 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:10,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:57:10,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:10,576 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:68, output treesize:24 [2018-12-08 14:57:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-08 14:57:10,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:57:10,928 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-08 14:57:11,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:11,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:57:14,007 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:14,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:16,682 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:16,695 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:19,678 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 14:57:19,698 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:57:23,731 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:23,772 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:26,543 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:26,587 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:29,696 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:29,718 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:31,016 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:31,025 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:32,445 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:32,475 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:33,682 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:33,712 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:34,563 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:34,590 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:35,346 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:35,367 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:57:36,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 12 dim-2 vars, End of recursive call: 22 dim-0 vars, and 6 xjuncts. [2018-12-08 14:57:36,051 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 22 variables, input treesize:389, output treesize:301 [2018-12-08 14:58:09,938 WARN L180 SmtUtils]: Spent 13.50 s on a formula simplification. DAG size of input: 147 DAG size of output: 96 [2018-12-08 14:58:09,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:58:09,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 28 [2018-12-08 14:58:09,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-08 14:58:09,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-08 14:58:09,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1000, Unknown=9, NotChecked=130, Total=1260 [2018-12-08 14:58:09,955 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand 29 states. [2018-12-08 14:58:15,185 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2018-12-08 14:58:17,856 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-12-08 14:58:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:58:21,338 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2018-12-08 14:58:21,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 14:58:21,339 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-12-08 14:58:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:58:21,340 INFO L225 Difference]: With dead ends: 178 [2018-12-08 14:58:21,340 INFO L226 Difference]: Without dead ends: 178 [2018-12-08 14:58:21,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 61.1s TimeCoverageRelationStatistics Valid=195, Invalid=1695, Unknown=10, NotChecked=170, Total=2070 [2018-12-08 14:58:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-08 14:58:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 147. [2018-12-08 14:58:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-08 14:58:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2018-12-08 14:58:21,343 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 51 [2018-12-08 14:58:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:58:21,343 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2018-12-08 14:58:21,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-08 14:58:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2018-12-08 14:58:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 14:58:21,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:58:21,345 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:58:21,345 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:58:21,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:58:21,345 INFO L82 PathProgramCache]: Analyzing trace with hash -738413237, now seen corresponding path program 1 times [2018-12-08 14:58:21,345 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:58:21,345 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:58:21,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:58:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:58:21,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:58:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 14:58:21,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 14:58:21,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:58:21,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 14:58:21,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 14:58:21,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 14:58:21,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 14:58:21,488 INFO L87 Difference]: Start difference. First operand 147 states and 167 transitions. Second operand 5 states. [2018-12-08 14:58:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:58:21,710 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2018-12-08 14:58:21,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:58:21,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-08 14:58:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:58:21,710 INFO L225 Difference]: With dead ends: 142 [2018-12-08 14:58:21,710 INFO L226 Difference]: Without dead ends: 142 [2018-12-08 14:58:21,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:58:21,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-08 14:58:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-08 14:58:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-08 14:58:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2018-12-08 14:58:21,714 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 53 [2018-12-08 14:58:21,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:58:21,714 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2018-12-08 14:58:21,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 14:58:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2018-12-08 14:58:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 14:58:21,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:58:21,715 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:58:21,715 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:58:21,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:58:21,716 INFO L82 PathProgramCache]: Analyzing trace with hash -738413236, now seen corresponding path program 1 times [2018-12-08 14:58:21,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:58:21,716 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:58:21,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:58:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:58:21,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:58:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 14:58:21,908 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 14:58:21,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:58:21,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:58:21,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:58:21,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:58:21,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:58:21,910 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand 6 states. [2018-12-08 14:58:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:58:22,275 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2018-12-08 14:58:22,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:58:22,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-08 14:58:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:58:22,276 INFO L225 Difference]: With dead ends: 139 [2018-12-08 14:58:22,276 INFO L226 Difference]: Without dead ends: 139 [2018-12-08 14:58:22,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:58:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-08 14:58:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-08 14:58:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-08 14:58:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2018-12-08 14:58:22,279 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 53 [2018-12-08 14:58:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:58:22,279 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2018-12-08 14:58:22,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:58:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2018-12-08 14:58:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 14:58:22,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:58:22,280 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:58:22,280 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:58:22,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:58:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash -945515889, now seen corresponding path program 1 times [2018-12-08 14:58:22,280 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:58:22,281 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:58:22,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:58:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:58:22,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:58:22,429 INFO L478 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 [2018-12-08 14:58:22,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:22,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:22,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:58:22,480 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 14:58:22,481 INFO L478 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 8 treesize of output 7 [2018-12-08 14:58:22,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:22,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:22,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:22,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-12-08 14:58:22,517 INFO L478 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 [2018-12-08 14:58:22,518 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 14:58:22,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:22,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:22,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:22,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-08 14:58:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 14:58:22,545 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 14:58:22,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:58:22,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 14:58:22,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 14:58:22,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 14:58:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-08 14:58:22,548 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand 12 states. [2018-12-08 14:58:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:58:23,388 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-12-08 14:58:23,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 14:58:23,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-12-08 14:58:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:58:23,389 INFO L225 Difference]: With dead ends: 158 [2018-12-08 14:58:23,389 INFO L226 Difference]: Without dead ends: 158 [2018-12-08 14:58:23,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-08 14:58:23,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-08 14:58:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2018-12-08 14:58:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-08 14:58:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2018-12-08 14:58:23,393 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 55 [2018-12-08 14:58:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:58:23,393 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2018-12-08 14:58:23,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 14:58:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2018-12-08 14:58:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 14:58:23,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:58:23,394 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:58:23,394 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:58:23,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:58:23,394 INFO L82 PathProgramCache]: Analyzing trace with hash -945515888, now seen corresponding path program 1 times [2018-12-08 14:58:23,394 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:58:23,395 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:58:23,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:58:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:58:23,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:58:23,555 INFO L478 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 [2018-12-08 14:58:23,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 14:58:23,623 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 14:58:23,625 INFO L478 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 8 treesize of output 7 [2018-12-08 14:58:23,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,643 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 14:58:23,644 INFO L478 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 8 treesize of output 7 [2018-12-08 14:58:23,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,654 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-08 14:58:23,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 14:58:23,695 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 14:58:23,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,704 INFO L478 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 [2018-12-08 14:58:23,706 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 14:58:23,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:23,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-08 14:58:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 14:58:23,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 14:58:23,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:58:23,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 14:58:23,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 14:58:23,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 14:58:23,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-08 14:58:23,748 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand 12 states. [2018-12-08 14:58:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:58:24,726 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2018-12-08 14:58:24,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 14:58:24,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-12-08 14:58:24,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:58:24,727 INFO L225 Difference]: With dead ends: 161 [2018-12-08 14:58:24,728 INFO L226 Difference]: Without dead ends: 161 [2018-12-08 14:58:24,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-08 14:58:24,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-08 14:58:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2018-12-08 14:58:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-08 14:58:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 166 transitions. [2018-12-08 14:58:24,731 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 166 transitions. Word has length 55 [2018-12-08 14:58:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:58:24,731 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 166 transitions. [2018-12-08 14:58:24,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 14:58:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2018-12-08 14:58:24,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 14:58:24,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:58:24,732 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:58:24,732 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:58:24,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:58:24,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2055549922, now seen corresponding path program 1 times [2018-12-08 14:58:24,732 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:58:24,732 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:58:24,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:58:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:58:24,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:58:24,955 INFO L478 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 [2018-12-08 14:58:24,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:24,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:24,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:58:25,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:25,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:25,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-08 14:58:25,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:25,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:25,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2018-12-08 14:58:25,085 INFO L478 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 11 treesize of output 8 [2018-12-08 14:58:25,086 INFO L478 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 8 treesize of output 7 [2018-12-08 14:58:25,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:25,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:25,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:25,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-08 14:58:25,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-08 14:58:25,165 INFO L478 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 12 treesize of output 11 [2018-12-08 14:58:25,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:25,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:25,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:25,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:41 [2018-12-08 14:58:27,757 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-08 14:58:27,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:27,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:27,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:27,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 78 [2018-12-08 14:58:27,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:27,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2018-12-08 14:58:27,973 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-12-08 14:58:27,984 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:58:27,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:28,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:28,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:28,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:28,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:28,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 106 [2018-12-08 14:58:28,251 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 121 [2018-12-08 14:58:28,257 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:58:28,257 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:28,281 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:28,391 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2018-12-08 14:58:28,397 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:58:28,397 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:28,414 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:28,461 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:58:28,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:58:28,532 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:115, output treesize:178 [2018-12-08 14:58:29,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:29,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 20 [2018-12-08 14:58:29,093 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 14:58:29,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:29,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:29,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:29,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:130, output treesize:112 [2018-12-08 14:58:29,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:29,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:29,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:29,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:29,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 91 [2018-12-08 14:58:29,379 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 107 [2018-12-08 14:58:29,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-12-08 14:58:29,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2018-12-08 14:58:29,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:29,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2018-12-08 14:58:29,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:29,639 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-12-08 14:58:29,639 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:29,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2018-12-08 14:58:29,799 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:29,962 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2018-12-08 14:58:29,962 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:30,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-12-08 14:58:30,015 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:30,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 14:58:30,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:58:30,122 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:113, output treesize:75 [2018-12-08 14:58:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-08 14:58:30,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:58:31,092 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-08 14:58:31,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:31,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:31,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:31,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:31,769 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:31,802 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:31,913 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:31,939 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:32,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-08 14:58:32,025 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:145, output treesize:159 [2018-12-08 14:58:45,482 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 63 [2018-12-08 14:58:45,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:58:45,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:58:45,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:58:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:58:45,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:58:45,534 INFO L478 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 [2018-12-08 14:58:45,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:45,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:45,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 14:58:45,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:45,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:45,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-08 14:58:45,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:45,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:45,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2018-12-08 14:58:46,058 INFO L478 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 11 treesize of output 8 [2018-12-08 14:58:46,060 INFO L478 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 8 treesize of output 7 [2018-12-08 14:58:46,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:46,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:46,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:46,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-08 14:58:46,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-12-08 14:58:46,272 INFO L478 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 12 treesize of output 11 [2018-12-08 14:58:46,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:46,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:46,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:46,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-12-08 14:58:47,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:47,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:47,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:47,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 98 [2018-12-08 14:58:47,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:47,437 INFO L303 Elim1Store]: Index analysis took 111 ms [2018-12-08 14:58:47,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 115 treesize of output 113 [2018-12-08 14:58:47,468 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 118 [2018-12-08 14:58:47,477 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:58:47,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:47,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:47,694 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 85 [2018-12-08 14:58:47,702 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:58:47,702 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:47,742 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:47,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:58:47,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 82 [2018-12-08 14:58:47,949 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-12-08 14:58:47,956 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:58:47,957 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:47,969 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:47,989 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:48,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 128 [2018-12-08 14:58:48,052 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 125 [2018-12-08 14:58:48,062 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:58:48,062 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:48,085 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:48,252 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 108 [2018-12-08 14:58:48,259 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:58:48,259 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:48,280 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:48,358 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:58:48,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-12-08 14:58:48,489 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:124, output treesize:294 [2018-12-08 14:58:48,777 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2018-12-08 14:58:49,449 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 73 [2018-12-08 14:58:49,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:49,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 140 treesize of output 132 [2018-12-08 14:58:49,464 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 62 [2018-12-08 14:58:49,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:49,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:49,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:49,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:49,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 134 [2018-12-08 14:58:49,618 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 80 [2018-12-08 14:58:49,618 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:58:49,694 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 14:58:49,694 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:49,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:58:49,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-08 14:58:49,805 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:281, output treesize:221 [2018-12-08 14:58:50,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 91 [2018-12-08 14:58:50,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2018-12-08 14:58:50,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:50,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2018-12-08 14:58:50,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:50,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2018-12-08 14:58:50,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:50,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 71 treesize of output 59 [2018-12-08 14:58:50,810 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:50,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2018-12-08 14:58:50,953 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:51,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-12-08 14:58:51,079 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:51,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 51 treesize of output 45 [2018-12-08 14:58:51,207 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:51,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-12-08 14:58:51,352 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:51,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-08 14:58:51,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:51,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:58:51,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 97 [2018-12-08 14:58:51,698 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 81 [2018-12-08 14:58:51,699 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:58:51,992 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2018-12-08 14:58:51,993 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:52,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2018-12-08 14:58:52,200 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:52,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 67 [2018-12-08 14:58:52,506 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:52,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 53 [2018-12-08 14:58:52,691 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:52,867 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-12-08 14:58:52,867 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:53,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 64 [2018-12-08 14:58:53,007 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:53,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-08 14:58:53,148 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:53,290 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-12-08 14:58:53,290 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:53,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2018-12-08 14:58:53,438 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:53,579 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-12-08 14:58:53,579 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 14:58:53,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2018-12-08 14:58:53,694 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:53,785 INFO L267 ElimStorePlain]: Start of recursive call 11: 12 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-08 14:58:54,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 8 xjuncts. [2018-12-08 14:58:54,160 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 10 variables, input treesize:229, output treesize:281 [2018-12-08 14:58:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-08 14:58:54,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:58:54,647 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-08 14:58:54,872 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:54,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:55,189 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:55,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:55,399 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:55,430 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:55,559 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:55,586 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:58:55,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-08 14:58:55,675 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:149, output treesize:159 [2018-12-08 14:59:10,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:59:10,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 48 [2018-12-08 14:59:10,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-08 14:59:10,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-08 14:59:10,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2882, Unknown=4, NotChecked=108, Total=3192 [2018-12-08 14:59:10,380 INFO L87 Difference]: Start difference. First operand 147 states and 166 transitions. Second operand 49 states. [2018-12-08 14:59:19,526 WARN L180 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-12-08 14:59:23,965 WARN L180 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-12-08 14:59:25,126 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-12-08 14:59:27,912 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-12-08 14:59:29,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:59:29,899 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2018-12-08 14:59:29,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 14:59:29,900 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 56 [2018-12-08 14:59:29,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:59:29,901 INFO L225 Difference]: With dead ends: 172 [2018-12-08 14:59:29,901 INFO L226 Difference]: Without dead ends: 172 [2018-12-08 14:59:29,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 49.6s TimeCoverageRelationStatistics Valid=336, Invalid=4218, Unknown=6, NotChecked=132, Total=4692 [2018-12-08 14:59:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-08 14:59:29,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 149. [2018-12-08 14:59:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-08 14:59:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-12-08 14:59:29,905 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 56 [2018-12-08 14:59:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:59:29,905 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-12-08 14:59:29,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-08 14:59:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-12-08 14:59:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 14:59:29,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:59:29,906 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:59:29,906 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 14:59:29,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:59:29,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2055549923, now seen corresponding path program 1 times [2018-12-08 14:59:29,907 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 14:59:29,907 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9dd789-36a6-4e2f-9567-156b6d8ab9d3/bin-2019/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 14:59:29,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:59:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:59:30,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:59:30,128 INFO L478 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 [2018-12-08 14:59:30,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,136 INFO L478 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 [2018-12-08 14:59:30,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 14:59:30,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:30,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:30,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 14:59:30,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,275 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 14:59:30,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:35 [2018-12-08 14:59:30,380 INFO L478 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 11 treesize of output 8 [2018-12-08 14:59:30,382 INFO L478 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 8 treesize of output 7 [2018-12-08 14:59:30,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,411 INFO L478 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 11 treesize of output 8 [2018-12-08 14:59:30,413 INFO L478 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 8 treesize of output 7 [2018-12-08 14:59:30,413 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,432 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-12-08 14:59:30,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2018-12-08 14:59:30,548 INFO L478 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 12 treesize of output 11 [2018-12-08 14:59:30,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-08 14:59:30,607 INFO L478 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 12 treesize of output 11 [2018-12-08 14:59:30,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:30,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:59:30,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:72 [2018-12-08 14:59:33,422 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv8 32))) (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.offset|))) is different from true [2018-12-08 14:59:33,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:33,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:33,445 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-12-08 14:59:33,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:33,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:33,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:33,577 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:59:33,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-08 14:59:33,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:33,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:33,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 108 [2018-12-08 14:59:33,821 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 99 [2018-12-08 14:59:33,831 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:59:33,831 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:33,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:34,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:34,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:34,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:34,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 126 [2018-12-08 14:59:34,182 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 147 [2018-12-08 14:59:34,188 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:59:34,188 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:34,220 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:34,387 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2018-12-08 14:59:34,395 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-08 14:59:34,395 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:34,418 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:59:34,482 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:59:34,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:59:34,566 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:164, output treesize:222 [2018-12-08 14:59:35,005 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-12-08 14:59:35,264 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2018-12-08 14:59:35,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:35,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:35,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 105 [2018-12-08 14:59:35,570 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 91 [2018-12-08 14:59:35,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:35,633 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2018-12-08 14:59:35,633 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:35,665 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-08 14:59:35,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:35,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:59:35,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:35,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:35,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:35,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:59:35,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 91 [2018-12-08 14:59:35,772 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2018-12-08 14:59:35,773 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:59:35,896 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-12-08 14:59:35,896 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:35,969 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 65 [2018-12-08 14:59:35,970 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:36,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2018-12-08 14:59:36,034 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:36,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-12-08 14:59:36,105 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 14:59:36,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-12-08 14:59:36,168 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:59:36,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-12-08 14:59:36,240 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:59:36,285 INFO L267 ElimStorePlain]: Start of recursive call 6: 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 14:59:36,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:59:36,351 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:172, output treesize:79 [2018-12-08 14:59:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-08 14:59:36,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 14:59:38,179 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-08 14:59:38,349 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-08 14:59:38,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:59:38,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:59:48,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:59:48,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:59:58,386 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:59:58,429 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:14,081 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:14,113 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:20,228 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:20,261 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:24,680 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:24,739 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:29,991 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:30,027 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:34,279 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:34,322 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:37,348 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:37,372 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:40,128 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:40,164 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:41,588 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:41,622 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:42,843 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:42,870 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:00:43,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2018-12-08 15:00:43,973 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 18 variables, input treesize:469, output treesize:637 [2018-12-08 15:00:48,803 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-08 15:00:49,004 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 15:00:49,006 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:893) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-08 15:00:49,012 INFO L168 Benchmark]: Toolchain (without parser) took 804302.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 939.4 MB in the beginning and 905.1 MB in the end (delta: 34.3 MB). Peak memory consumption was 153.8 MB. Max. memory is 11.5 GB. [2018-12-08 15:00:49,013 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:00:49,013 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-12-08 15:00:49,014 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:00:49,014 INFO L168 Benchmark]: Boogie Preprocessor took 22.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-08 15:00:49,015 INFO L168 Benchmark]: RCFGBuilder took 375.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-08 15:00:49,015 INFO L168 Benchmark]: TraceAbstraction took 803595.05 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -8.9 MB). Free memory was 1.1 GB in the beginning and 905.1 MB in the end (delta: 150.5 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. [2018-12-08 15:00:49,018 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 375.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 803595.05 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -8.9 MB). Free memory was 1.1 GB in the beginning and 905.1 MB in the end (delta: 150.5 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...