./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal_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_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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 1eb62d582bb1f498de7f5f7de60817c0efb48782 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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 1eb62d582bb1f498de7f5f7de60817c0efb48782 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-09 16:22:52,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:22:52,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:22:52,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:22:52,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:22:52,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:22:52,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:22:52,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:22:52,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:22:52,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:22:52,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:22:52,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:22:52,025 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:22:52,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:22:52,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:22:52,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:22:52,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:22:52,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:22:52,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:22:52,031 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:22:52,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:22:52,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:22:52,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:22:52,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:22:52,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:22:52,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:22:52,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:22:52,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:22:52,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:22:52,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:22:52,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:22:52,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:22:52,038 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:22:52,038 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:22:52,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:22:52,039 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:22:52,040 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 16:22:52,050 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:22:52,050 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:22:52,051 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:22:52,051 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:22:52,051 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:22:52,051 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:22:52,052 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:22:52,052 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:22:52,052 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:22:52,052 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:22:52,052 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:22:52,052 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:22:52,052 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:22:52,053 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:22:52,053 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:22:52,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:22:52,053 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:22:52,053 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 16:22:52,053 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:22:52,054 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:22:52,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:22:52,054 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 16:22:52,054 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 16:22:52,054 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 16:22:52,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:22:52,054 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:22:52,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:22:52,055 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:22:52,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:22:52,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:22:52,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:22:52,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:22:52,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:22:52,055 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:22:52,055 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:22:52,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:22:52,055 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_c8335da2-f030-4442-aac6-9bf0d57f3513/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 -> 1eb62d582bb1f498de7f5f7de60817c0efb48782 [2018-12-09 16:22:52,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:22:52,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:22:52,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:22:52,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:22:52,091 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:22:52,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 16:22:52,131 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/data/656b55b0e/ce0d8278e5234fffabac718dff53edc0/FLAG9ea417dde [2018-12-09 16:22:52,553 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:22:52,554 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 16:22:52,560 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/data/656b55b0e/ce0d8278e5234fffabac718dff53edc0/FLAG9ea417dde [2018-12-09 16:22:52,962 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/data/656b55b0e/ce0d8278e5234fffabac718dff53edc0 [2018-12-09 16:22:52,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:22:52,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:22:52,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:22:52,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:22:52,967 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:22:52,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:22:52" (1/1) ... [2018-12-09 16:22:52,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75090e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:52, skipping insertion in model container [2018-12-09 16:22:52,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:22:52" (1/1) ... [2018-12-09 16:22:52,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:22:52,992 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:22:53,142 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:22:53,149 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:22:53,221 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:22:53,243 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:22:53,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53 WrapperNode [2018-12-09 16:22:53,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:22:53,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:22:53,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:22:53,244 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:22:53,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53" (1/1) ... [2018-12-09 16:22:53,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53" (1/1) ... [2018-12-09 16:22:53,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:22:53,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:22:53,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:22:53,263 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:22:53,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53" (1/1) ... [2018-12-09 16:22:53,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53" (1/1) ... [2018-12-09 16:22:53,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53" (1/1) ... [2018-12-09 16:22:53,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53" (1/1) ... [2018-12-09 16:22:53,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53" (1/1) ... [2018-12-09 16:22:53,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53" (1/1) ... [2018-12-09 16:22:53,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53" (1/1) ... [2018-12-09 16:22:53,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:22:53,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:22:53,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:22:53,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:22:53,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:22:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 16:22:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 16:22:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:22:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 16:22:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 16:22:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 16:22:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 16:22:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_append [2018-12-09 16:22:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_append [2018-12-09 16:22:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:22:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:22:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:22:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:22:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 16:22:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 16:22:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-09 16:22:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-09 16:22:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:22:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 16:22:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-09 16:22:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-09 16:22:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:22:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:22:53,591 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:22:53,591 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 16:22:53,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:22:53 BoogieIcfgContainer [2018-12-09 16:22:53,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:22:53,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:22:53,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:22:53,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:22:53,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:22:52" (1/3) ... [2018-12-09 16:22:53,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91f0109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:22:53, skipping insertion in model container [2018-12-09 16:22:53,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:53" (2/3) ... [2018-12-09 16:22:53,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91f0109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:22:53, skipping insertion in model container [2018-12-09 16:22:53,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:22:53" (3/3) ... [2018-12-09 16:22:53,596 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 16:22:53,601 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:22:53,606 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-12-09 16:22:53,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-12-09 16:22:53,629 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:22:53,629 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 16:22:53,629 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:22:53,629 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:22:53,629 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:22:53,630 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:22:53,630 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:22:53,630 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:22:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-12-09 16:22:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 16:22:53,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:53,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:53,647 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:53,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -321535227, now seen corresponding path program 1 times [2018-12-09 16:22:53,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:53,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:53,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:53,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:53,748 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-09 16:22:53,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:53,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:22:53,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:53,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:22:53,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:22:53,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:22:53,762 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-12-09 16:22:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:53,844 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-12-09 16:22:53,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:22:53,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 16:22:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:53,851 INFO L225 Difference]: With dead ends: 142 [2018-12-09 16:22:53,851 INFO L226 Difference]: Without dead ends: 135 [2018-12-09 16:22:53,852 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-09 16:22:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-09 16:22:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-09 16:22:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-09 16:22:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-12-09 16:22:53,880 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 12 [2018-12-09 16:22:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:53,880 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-12-09 16:22:53,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:22:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-12-09 16:22:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 16:22:53,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:53,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:53,881 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:53,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:53,881 INFO L82 PathProgramCache]: Analyzing trace with hash -321535226, now seen corresponding path program 1 times [2018-12-09 16:22:53,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:53,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:53,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:53,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:53,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:53,930 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-09 16:22:53,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:53,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:22:53,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:53,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:22:53,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:22:53,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:22:53,931 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 3 states. [2018-12-09 16:22:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:53,986 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-12-09 16:22:53,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:22:53,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 16:22:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:53,988 INFO L225 Difference]: With dead ends: 133 [2018-12-09 16:22:53,988 INFO L226 Difference]: Without dead ends: 133 [2018-12-09 16:22:53,989 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-09 16:22:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-09 16:22:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-09 16:22:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 16:22:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-12-09 16:22:53,996 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-12-09 16:22:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:53,997 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-12-09 16:22:53,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:22:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-12-09 16:22:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 16:22:53,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:53,998 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-09 16:22:53,998 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:53,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:53,998 INFO L82 PathProgramCache]: Analyzing trace with hash 851167050, now seen corresponding path program 1 times [2018-12-09 16:22:53,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:53,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:53,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:53,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:54,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:54,043 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-09 16:22:54,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:54,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:22:54,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:54,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:22:54,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:22:54,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:22:54,044 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 6 states. [2018-12-09 16:22:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:54,207 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-12-09 16:22:54,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:22:54,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-09 16:22:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:54,210 INFO L225 Difference]: With dead ends: 137 [2018-12-09 16:22:54,210 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 16:22:54,210 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-09 16:22:54,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 16:22:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-12-09 16:22:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-09 16:22:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-12-09 16:22:54,216 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 19 [2018-12-09 16:22:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:54,217 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-12-09 16:22:54,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:22:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-12-09 16:22:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 16:22:54,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:54,217 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-09 16:22:54,218 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:54,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:54,218 INFO L82 PathProgramCache]: Analyzing trace with hash 851167051, now seen corresponding path program 1 times [2018-12-09 16:22:54,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:54,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:54,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:54,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:54,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:54,246 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-09 16:22:54,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:54,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:22:54,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:54,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:22:54,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:22:54,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:22:54,248 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 5 states. [2018-12-09 16:22:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:54,266 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-12-09 16:22:54,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:22:54,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-09 16:22:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:54,267 INFO L225 Difference]: With dead ends: 134 [2018-12-09 16:22:54,267 INFO L226 Difference]: Without dead ends: 134 [2018-12-09 16:22:54,267 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-09 16:22:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-09 16:22:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-09 16:22:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-09 16:22:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-12-09 16:22:54,272 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 19 [2018-12-09 16:22:54,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:54,272 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-12-09 16:22:54,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:22:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-12-09 16:22:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:22:54,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:54,272 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-09 16:22:54,273 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:54,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:54,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1063532723, now seen corresponding path program 1 times [2018-12-09 16:22:54,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:54,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:54,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:54,313 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-09 16:22:54,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:54,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:22:54,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:54,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:22:54,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:22:54,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:22:54,314 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 6 states. [2018-12-09 16:22:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:54,449 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-12-09 16:22:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:22:54,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 16:22:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:54,451 INFO L225 Difference]: With dead ends: 134 [2018-12-09 16:22:54,451 INFO L226 Difference]: Without dead ends: 134 [2018-12-09 16:22:54,451 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-09 16:22:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-09 16:22:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-12-09 16:22:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 16:22:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-12-09 16:22:54,456 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 28 [2018-12-09 16:22:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:54,456 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-12-09 16:22:54,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:22:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-12-09 16:22:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:22:54,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:54,457 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-09 16:22:54,458 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:54,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:54,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1063532724, now seen corresponding path program 1 times [2018-12-09 16:22:54,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:54,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:54,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:54,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:54,506 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-09 16:22:54,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:54,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:22:54,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:54,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:22:54,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:22:54,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:22:54,507 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 6 states. [2018-12-09 16:22:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:54,636 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-12-09 16:22:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:22:54,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 16:22:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:54,637 INFO L225 Difference]: With dead ends: 133 [2018-12-09 16:22:54,637 INFO L226 Difference]: Without dead ends: 133 [2018-12-09 16:22:54,637 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-09 16:22:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-09 16:22:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-12-09 16:22:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 16:22:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-12-09 16:22:54,640 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 28 [2018-12-09 16:22:54,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:54,641 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-12-09 16:22:54,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:22:54,641 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-12-09 16:22:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 16:22:54,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:54,641 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-09 16:22:54,641 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:54,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash -270265832, now seen corresponding path program 1 times [2018-12-09 16:22:54,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:54,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:54,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:54,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:54,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:54,754 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-09 16:22:54,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:54,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:22:54,755 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-09 16:22:54,756 INFO L205 CegarAbsIntRunner]: [55], [133], [134], [140], [142], [149], [151], [153], [154], [157], [162], [205], [211], [213], [216], [219], [220], [223], [229], [230], [231], [232], [233], [234], [235] [2018-12-09 16:22:54,779 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:22:54,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:22:54,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:22:54,941 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-09 16:22:54,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:54,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:22:54,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:54,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:22:54,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:54,956 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:22:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:54,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:22:55,019 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-09 16:22:55,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:55,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:55,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:22:55,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:55,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:55,064 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-09 16:22:55,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:55,078 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-09 16:22:55,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-09 16:22:55,109 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-09 16:22:55,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:22:55,280 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-09 16:22:55,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:22:55,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2018-12-09 16:22:55,296 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:22:55,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 16:22:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 16:22:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-12-09 16:22:55,297 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 12 states. [2018-12-09 16:22:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:55,648 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-12-09 16:22:55,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 16:22:55,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-09 16:22:55,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:55,649 INFO L225 Difference]: With dead ends: 147 [2018-12-09 16:22:55,649 INFO L226 Difference]: Without dead ends: 147 [2018-12-09 16:22:55,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-09 16:22:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-09 16:22:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2018-12-09 16:22:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-09 16:22:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-12-09 16:22:55,655 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 31 [2018-12-09 16:22:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:55,655 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-12-09 16:22:55,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 16:22:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-12-09 16:22:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 16:22:55,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:55,656 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-09 16:22:55,656 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:55,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:55,656 INFO L82 PathProgramCache]: Analyzing trace with hash -270265831, now seen corresponding path program 1 times [2018-12-09 16:22:55,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:55,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:55,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:55,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:55,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:55,757 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-09 16:22:55,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:55,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:22:55,757 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-09 16:22:55,757 INFO L205 CegarAbsIntRunner]: [55], [133], [134], [140], [142], [149], [151], [153], [154], [157], [163], [205], [211], [213], [216], [219], [220], [223], [229], [230], [231], [232], [233], [234], [235] [2018-12-09 16:22:55,758 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:22:55,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:22:55,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:22:55,813 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-09 16:22:55,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:55,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:22:55,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:55,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:22:55,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:55,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:22:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:55,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:22:55,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-09 16:22:55,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:55,848 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-09 16:22:55,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:55,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:55,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:22:55,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:55,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:55,901 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-09 16:22:55,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:55,907 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-09 16:22:55,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:55,912 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-09 16:22:55,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-12-09 16:22:55,942 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-09 16:22:55,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:22:55,995 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-09 16:22:56,286 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-09 16:22:56,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:22:56,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2018-12-09 16:22:56,301 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:22:56,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 16:22:56,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 16:22:56,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:22:56,301 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 13 states. [2018-12-09 16:22:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:57,496 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-12-09 16:22:57,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 16:22:57,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-12-09 16:22:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:57,497 INFO L225 Difference]: With dead ends: 146 [2018-12-09 16:22:57,497 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 16:22:57,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2018-12-09 16:22:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 16:22:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2018-12-09 16:22:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-09 16:22:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-12-09 16:22:57,501 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 31 [2018-12-09 16:22:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:57,501 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-12-09 16:22:57,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 16:22:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-12-09 16:22:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 16:22:57,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:57,502 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-09 16:22:57,502 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:57,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:57,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2107190679, now seen corresponding path program 1 times [2018-12-09 16:22:57,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:57,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:57,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:57,662 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-09 16:22:57,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:57,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:22:57,663 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-12-09 16:22:57,663 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [55], [57], [133], [134], [140], [142], [149], [151], [153], [154], [157], [161], [164], [165], [205], [211], [213], [216], [219], [220], [221], [222], [223], [224], [225], [229], [230], [231], [232], [233], [234], [235] [2018-12-09 16:22:57,664 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:22:57,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:22:57,728 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:22:57,728 INFO L272 AbstractInterpreter]: Visited 35 different actions 77 times. Merged at 9 different actions 14 times. Never widened. Performed 831 root evaluator evaluations with a maximum evaluation depth of 3. Performed 831 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-09 16:22:57,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:57,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:22:57,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:57,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:22:57,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:57,738 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:22:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:57,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:22:57,772 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-09 16:22:57,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:57,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:57,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:22:58,032 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-09 16:23:00,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:00,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:00,053 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-09 16:23:00,056 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-09 16:23:00,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:00,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:00,064 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-09 16:23:00,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-12-09 16:23:00,104 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-09 16:23:00,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:00,108 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-09 16:23:00,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-12-09 16:23:00,121 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-09 16:23:00,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:23:00,751 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:23:00,752 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 26950 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-09 16:23:00,757 INFO L168 Benchmark]: Toolchain (without parser) took 7793.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 947.0 MB in the beginning and 875.7 MB in the end (delta: 71.3 MB). Peak memory consumption was 257.9 MB. Max. memory is 11.5 GB. [2018-12-09 16:23:00,759 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:23:00,760 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-09 16:23:00,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.21 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-09 16:23:00,760 INFO L168 Benchmark]: Boogie Preprocessor took 20.85 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:23:00,761 INFO L168 Benchmark]: RCFGBuilder took 308.10 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-09 16:23:00,761 INFO L168 Benchmark]: TraceAbstraction took 7164.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 875.7 MB in the end (delta: 202.1 MB). Peak memory consumption was 249.8 MB. Max. memory is 11.5 GB. [2018-12-09 16:23:00,763 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.21 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.85 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 308.10 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7164.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 875.7 MB in the end (delta: 202.1 MB). Peak memory consumption was 249.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 26950 column 11: unknown constant v_node_create_#t~malloc2.base_33 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 26950 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-09 16:23:02,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:23:02,066 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:23:02,074 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:23:02,074 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:23:02,075 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:23:02,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:23:02,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:23:02,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:23:02,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:23:02,079 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:23:02,079 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:23:02,080 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:23:02,081 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:23:02,082 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:23:02,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:23:02,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:23:02,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:23:02,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:23:02,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:23:02,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:23:02,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:23:02,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:23:02,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:23:02,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:23:02,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:23:02,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:23:02,091 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:23:02,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:23:02,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:23:02,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:23:02,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:23:02,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:23:02,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:23:02,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:23:02,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:23:02,095 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 16:23:02,105 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:23:02,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:23:02,106 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:23:02,106 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:23:02,106 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:23:02,107 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:23:02,107 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:23:02,107 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:23:02,107 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:23:02,107 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:23:02,108 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:23:02,108 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:23:02,108 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:23:02,108 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:23:02,108 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 16:23:02,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:23:02,108 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:23:02,109 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:23:02,109 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 16:23:02,109 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 16:23:02,109 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 16:23:02,109 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:23:02,109 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 16:23:02,109 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 16:23:02,109 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:23:02,110 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 16:23:02,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:23:02,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:23:02,110 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:23:02,110 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:23:02,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:23:02,110 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:23:02,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:23:02,111 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 16:23:02,111 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:23:02,111 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 16:23:02,111 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_c8335da2-f030-4442-aac6-9bf0d57f3513/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 -> 1eb62d582bb1f498de7f5f7de60817c0efb48782 [2018-12-09 16:23:02,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:23:02,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:23:02,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:23:02,145 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:23:02,145 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:23:02,146 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 16:23:02,180 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/data/fe464a94f/226ca2309eb64c12b0860a3b1ea9547b/FLAG8eb1df8bc [2018-12-09 16:23:02,607 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:23:02,608 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 16:23:02,614 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/data/fe464a94f/226ca2309eb64c12b0860a3b1ea9547b/FLAG8eb1df8bc [2018-12-09 16:23:02,622 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/data/fe464a94f/226ca2309eb64c12b0860a3b1ea9547b [2018-12-09 16:23:02,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:23:02,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:23:02,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:23:02,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:23:02,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:23:02,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:23:02" (1/1) ... [2018-12-09 16:23:02,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46be3c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02, skipping insertion in model container [2018-12-09 16:23:02,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:23:02" (1/1) ... [2018-12-09 16:23:02,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:23:02,665 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:23:02,833 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:23:02,841 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:23:02,910 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:23:02,935 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:23:02,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02 WrapperNode [2018-12-09 16:23:02,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:23:02,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:23:02,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:23:02,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:23:02,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02" (1/1) ... [2018-12-09 16:23:02,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02" (1/1) ... [2018-12-09 16:23:02,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:23:02,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:23:02,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:23:02,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:23:02,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02" (1/1) ... [2018-12-09 16:23:02,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02" (1/1) ... [2018-12-09 16:23:02,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02" (1/1) ... [2018-12-09 16:23:02,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02" (1/1) ... [2018-12-09 16:23:02,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02" (1/1) ... [2018-12-09 16:23:02,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02" (1/1) ... [2018-12-09 16:23:02,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02" (1/1) ... [2018-12-09 16:23:02,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:23:02,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:23:02,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:23:02,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:23:02,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 16:23:03,011 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 16:23:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:23:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 16:23:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 16:23:03,011 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 16:23:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_append [2018-12-09 16:23:03,011 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_append [2018-12-09 16:23:03,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:23:03,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:23:03,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:23:03,012 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:23:03,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 16:23:03,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 16:23:03,012 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-09 16:23:03,012 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-09 16:23:03,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:23:03,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 16:23:03,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 16:23:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-09 16:23:03,013 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-09 16:23:03,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:23:03,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:23:03,393 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:23:03,393 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 16:23:03,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:23:03 BoogieIcfgContainer [2018-12-09 16:23:03,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:23:03,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:23:03,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:23:03,396 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:23:03,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:23:02" (1/3) ... [2018-12-09 16:23:03,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5784b3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:23:03, skipping insertion in model container [2018-12-09 16:23:03,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:02" (2/3) ... [2018-12-09 16:23:03,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5784b3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:23:03, skipping insertion in model container [2018-12-09 16:23:03,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:23:03" (3/3) ... [2018-12-09 16:23:03,398 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 16:23:03,404 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:23:03,408 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-12-09 16:23:03,417 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-12-09 16:23:03,431 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 16:23:03,432 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:23:03,432 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 16:23:03,432 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:23:03,432 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:23:03,432 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:23:03,432 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:23:03,432 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:23:03,433 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:23:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-12-09 16:23:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 16:23:03,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:03,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:23:03,449 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:23:03,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -321535227, now seen corresponding path program 1 times [2018-12-09 16:23:03,455 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:23:03,455 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:03,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:03,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:03,543 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-09 16:23:03,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:03,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:03,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:23:03,555 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-09 16:23:03,555 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:23:03,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:03,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:23:03,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:23:03,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:23:03,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:23:03,570 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-12-09 16:23:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:03,771 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-12-09 16:23:03,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:23:03,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 16:23:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:03,778 INFO L225 Difference]: With dead ends: 142 [2018-12-09 16:23:03,779 INFO L226 Difference]: Without dead ends: 135 [2018-12-09 16:23:03,780 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-09 16:23:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-09 16:23:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-09 16:23:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-09 16:23:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-12-09 16:23:03,814 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 12 [2018-12-09 16:23:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:03,814 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-12-09 16:23:03,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:23:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-12-09 16:23:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 16:23:03,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:03,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:23:03,815 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:23:03,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:03,816 INFO L82 PathProgramCache]: Analyzing trace with hash -321535226, now seen corresponding path program 1 times [2018-12-09 16:23:03,816 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:23:03,816 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:03,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:03,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:03,865 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-09 16:23:03,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:03,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:03,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:23:03,875 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-09 16:23:03,875 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:23:03,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:03,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:23:03,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:23:03,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:23:03,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:23:03,878 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 3 states. [2018-12-09 16:23:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:04,059 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-12-09 16:23:04,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:23:04,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 16:23:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:04,060 INFO L225 Difference]: With dead ends: 133 [2018-12-09 16:23:04,060 INFO L226 Difference]: Without dead ends: 133 [2018-12-09 16:23:04,061 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-09 16:23:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-09 16:23:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-09 16:23:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 16:23:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-12-09 16:23:04,066 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-12-09 16:23:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:04,067 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-12-09 16:23:04,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:23:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-12-09 16:23:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 16:23:04,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:04,067 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-09 16:23:04,068 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:23:04,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:04,068 INFO L82 PathProgramCache]: Analyzing trace with hash 851167050, now seen corresponding path program 1 times [2018-12-09 16:23:04,068 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:23:04,068 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:04,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:04,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:04,133 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-09 16:23:04,133 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:23:04,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:04,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:23:04,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:23:04,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:23:04,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:23:04,135 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 5 states. [2018-12-09 16:23:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:04,162 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-12-09 16:23:04,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:23:04,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-09 16:23:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:04,163 INFO L225 Difference]: With dead ends: 140 [2018-12-09 16:23:04,163 INFO L226 Difference]: Without dead ends: 140 [2018-12-09 16:23:04,163 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-09 16:23:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-09 16:23:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2018-12-09 16:23:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-09 16:23:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-12-09 16:23:04,170 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 19 [2018-12-09 16:23:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:04,170 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-12-09 16:23:04,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:23:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-12-09 16:23:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:23:04,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:04,171 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-09 16:23:04,171 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:23:04,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:04,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1063532723, now seen corresponding path program 1 times [2018-12-09 16:23:04,172 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:23:04,172 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:04,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:04,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:04,263 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-09 16:23:04,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:04,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:04,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:23:04,289 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-09 16:23:04,289 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:23:04,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:04,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:23:04,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:23:04,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:23:04,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:23:04,291 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 6 states. [2018-12-09 16:23:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:04,674 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-12-09 16:23:04,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:23:04,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 16:23:04,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:04,676 INFO L225 Difference]: With dead ends: 134 [2018-12-09 16:23:04,676 INFO L226 Difference]: Without dead ends: 134 [2018-12-09 16:23:04,676 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-09 16:23:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-09 16:23:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-12-09 16:23:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 16:23:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-12-09 16:23:04,681 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 28 [2018-12-09 16:23:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:04,681 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-12-09 16:23:04,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:23:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-12-09 16:23:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:23:04,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:04,682 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-09 16:23:04,682 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:23:04,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:04,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1063532724, now seen corresponding path program 1 times [2018-12-09 16:23:04,682 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:23:04,682 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:04,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:04,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:04,767 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-09 16:23:04,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:04,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:04,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:23:04,815 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-09 16:23:04,815 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:23:04,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:04,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:23:04,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:23:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:23:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:23:04,817 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 6 states. [2018-12-09 16:23:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:05,245 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-12-09 16:23:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:23:05,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 16:23:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:05,246 INFO L225 Difference]: With dead ends: 133 [2018-12-09 16:23:05,246 INFO L226 Difference]: Without dead ends: 133 [2018-12-09 16:23:05,246 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-09 16:23:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-09 16:23:05,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-12-09 16:23:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 16:23:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-12-09 16:23:05,252 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 28 [2018-12-09 16:23:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:05,252 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-12-09 16:23:05,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:23:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-12-09 16:23:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 16:23:05,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:05,253 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-09 16:23:05,253 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:23:05,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:05,254 INFO L82 PathProgramCache]: Analyzing trace with hash -270265832, now seen corresponding path program 1 times [2018-12-09 16:23:05,254 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:23:05,254 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:05,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:05,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:05,351 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-09 16:23:05,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:05,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:05,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:23:05,763 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-09 16:23:05,772 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-09 16:23:05,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:05,780 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-09 16:23:05,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-09 16:23:05,790 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-09 16:23:05,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:23:05,906 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-09 16:23:05,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:23:05,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:05,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:05,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:05,947 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-09 16:23:05,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:05,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:05,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:23:07,964 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-09 16:23:07,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:07,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:07,974 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-09 16:23:07,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:07,980 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-09 16:23:07,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-09 16:23:08,000 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-09 16:23:08,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:23:08,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:23:08,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 10 [2018-12-09 16:23:08,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 16:23:08,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 16:23:08,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=66, Unknown=7, NotChecked=34, Total=132 [2018-12-09 16:23:08,060 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 11 states. [2018-12-09 16:23:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:10,871 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-12-09 16:23:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 16:23:10,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-12-09 16:23:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:10,872 INFO L225 Difference]: With dead ends: 147 [2018-12-09 16:23:10,872 INFO L226 Difference]: Without dead ends: 147 [2018-12-09 16:23:10,872 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-09 16:23:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-09 16:23:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2018-12-09 16:23:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-09 16:23:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-12-09 16:23:10,875 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 31 [2018-12-09 16:23:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:10,875 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-12-09 16:23:10,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 16:23:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-12-09 16:23:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 16:23:10,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:10,876 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-09 16:23:10,876 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:23:10,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:10,876 INFO L82 PathProgramCache]: Analyzing trace with hash -270265831, now seen corresponding path program 1 times [2018-12-09 16:23:10,877 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:23:10,877 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:10,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:10,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:10,984 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-09 16:23:10,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:10,994 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-09 16:23:10,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:11,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:11,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:23:12,670 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-09 16:23:12,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:12,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:12,681 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-09 16:23:12,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:12,692 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-09 16:23:12,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:12,701 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-09 16:23:12,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2018-12-09 16:23:12,724 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-09 16:23:12,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:23:12,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:23:12,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:12,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:12,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:12,888 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-09 16:23:12,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:12,896 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-09 16:23:12,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:12,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:12,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:23:12,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:12,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:12,915 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-09 16:23:12,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:12,924 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-09 16:23:12,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:12,931 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-09 16:23:12,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2018-12-09 16:23:12,935 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-09 16:23:12,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:23:13,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:23:13,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-09 16:23:13,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:23:13,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:23:13,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2018-12-09 16:23:13,029 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 9 states. [2018-12-09 16:23:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:13,969 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-12-09 16:23:13,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 16:23:13,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-12-09 16:23:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:13,970 INFO L225 Difference]: With dead ends: 146 [2018-12-09 16:23:13,970 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 16:23:13,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2018-12-09 16:23:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 16:23:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2018-12-09 16:23:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-09 16:23:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-12-09 16:23:13,973 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 31 [2018-12-09 16:23:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:13,974 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-12-09 16:23:13,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:23:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-12-09 16:23:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 16:23:13,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:13,974 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-09 16:23:13,975 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:23:13,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2107190679, now seen corresponding path program 1 times [2018-12-09 16:23:13,975 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:23:13,975 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:13,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:14,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:14,153 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-09 16:23:14,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:14,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:14,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:23:14,652 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-09 16:23:15,011 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-09 16:23:15,395 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-09 16:23:17,685 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-09 16:23:17,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:17,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:17,696 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-09 16:23:17,701 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-09 16:23:17,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:17,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:17,714 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-09 16:23:17,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-09 16:23:17,781 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-09 16:23:17,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:17,789 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-09 16:23:17,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-12-09 16:23:17,812 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-09 16:23:17,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:23:27,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:23:27,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:23:27,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:27,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:27,552 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-09 16:23:27,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:27,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:27,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:23:30,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:30,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:23:30,864 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-09 16:23:30,870 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-09 16:23:30,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:30,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:30,887 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-09 16:23:30,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-09 16:23:30,902 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-09 16:23:30,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:30,910 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-09 16:23:30,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-12-09 16:23:30,930 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-09 16:23:30,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:23:42,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:23:42,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2018-12-09 16:23:42,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 16:23:42,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 16:23:42,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=116, Unknown=13, NotChecked=46, Total=210 [2018-12-09 16:23:42,470 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 11 states. [2018-12-09 16:23:54,887 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-09 16:24:16,203 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 16:24:16,909 WARN L180 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-09 16:26:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:26:19,239 INFO L93 Difference]: Finished difference Result 190 states and 205 transitions. [2018-12-09 16:26:19,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:26:19,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-12-09 16:26:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:26:19,240 INFO L225 Difference]: With dead ends: 190 [2018-12-09 16:26:19,240 INFO L226 Difference]: Without dead ends: 190 [2018-12-09 16:26:19,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=58, Invalid=176, Unknown=18, NotChecked=90, Total=342 [2018-12-09 16:26:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-09 16:26:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 158. [2018-12-09 16:26:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-09 16:26:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-12-09 16:26:19,244 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 47 [2018-12-09 16:26:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:26:19,244 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-12-09 16:26:19,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 16:26:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-12-09 16:26:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 16:26:19,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:26:19,245 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-09 16:26:19,245 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:26:19,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:26:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2107190678, now seen corresponding path program 1 times [2018-12-09 16:26:19,245 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:26:19,245 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:26:19,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:26:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:26:19,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:26:19,438 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-09 16:26:19,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:19,447 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-09 16:26:19,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:19,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:19,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:26:21,509 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-09 16:26:32,004 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-09 16:26:34,008 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-09 16:26:34,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:34,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:34,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:34,055 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-09 16:26:34,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:34,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:34,078 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-09 16:26:34,082 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-09 16:26:34,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:34,097 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:34,117 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-09 16:26:34,117 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:25 [2018-12-09 16:26:36,825 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-09 16:26:36,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,852 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-09 16:26:36,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 16:26:36,898 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-09 16:26:36,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:60 [2018-12-09 16:26:38,992 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-09 16:26:38,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:26:41,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:26:41,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:26:41,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:26:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:26:41,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:26:41,246 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-09 16:26:41,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:41,252 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-09 16:26:41,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:41,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:41,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:26:48,497 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-09 16:26:48,499 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-09 16:26:48,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-09 16:26:48,739 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 49 [2018-12-09 16:26:48,743 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 32 treesize of output 26 [2018-12-09 16:26:48,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,782 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 35 treesize of output 34 [2018-12-09 16:26:48,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,808 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-09 16:26:48,809 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-12-09 16:26:54,402 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 16:26:56,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:56,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:56,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 35 [2018-12-09 16:26:56,549 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 2 case distinctions, treesize of input 27 treesize of output 32 [2018-12-09 16:26:56,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:26:56,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:26:56,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:56,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:56,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 17 treesize of output 8 [2018-12-09 16:26:56,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:56,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 16:26:56,631 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:83 [2018-12-09 16:26:56,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:56,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:56,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 60 [2018-12-09 16:26:56,857 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 43 [2018-12-09 16:26:56,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:56,892 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 32 treesize of output 25 [2018-12-09 16:26:56,892 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:56,920 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 31 treesize of output 27 [2018-12-09 16:26:56,920 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-09 16:26:56,953 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2018-12-09 16:26:56,953 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 16:26:56,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-09 16:26:56,993 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-09 16:26:57,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 16:26:57,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 16:26:57,123 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:115, output treesize:61 [2018-12-09 16:26:59,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:59,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:59,440 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 2 case distinctions, treesize of input 21 treesize of output 24 [2018-12-09 16:26:59,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 16:26:59,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 16:26:59,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:38 [2018-12-09 16:26:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2018-12-09 16:26:59,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:26:59,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:26:59,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 32 [2018-12-09 16:26:59,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-09 16:26:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-09 16:26:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=899, Unknown=18, NotChecked=186, Total=1190 [2018-12-09 16:26:59,752 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 33 states. [2018-12-09 16:27:16,236 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 16:27:22,483 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 16:27:28,361 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 16:27:34,739 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-12-09 16:27:39,065 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 30 [2018-12-09 16:27:45,618 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-12-09 16:27:54,042 WARN L180 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-12-09 16:28:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:28:55,551 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2018-12-09 16:28:55,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 16:28:55,551 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-12-09 16:28:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:28:55,552 INFO L225 Difference]: With dead ends: 184 [2018-12-09 16:28:55,552 INFO L226 Difference]: Without dead ends: 184 [2018-12-09 16:28:55,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 79.4s TimeCoverageRelationStatistics Valid=159, Invalid=1806, Unknown=27, NotChecked=264, Total=2256 [2018-12-09 16:28:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-09 16:28:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 158. [2018-12-09 16:28:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-09 16:28:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2018-12-09 16:28:55,557 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 47 [2018-12-09 16:28:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:28:55,557 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2018-12-09 16:28:55,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-09 16:28:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2018-12-09 16:28:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 16:28:55,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:28:55,558 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-09 16:28:55,558 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:28:55,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:28:55,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2080646806, now seen corresponding path program 1 times [2018-12-09 16:28:55,559 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:28:55,559 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:28:55,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:28:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:28:55,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:28:55,681 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-09 16:28:55,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:55,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:28:55,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:28:55,711 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-09 16:28:55,711 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:28:55,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:28:55,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:28:55,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:28:55,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:28:55,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:28:55,714 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand 6 states. [2018-12-09 16:28:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:28:56,043 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2018-12-09 16:28:56,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:28:56,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-12-09 16:28:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:28:56,044 INFO L225 Difference]: With dead ends: 156 [2018-12-09 16:28:56,044 INFO L226 Difference]: Without dead ends: 156 [2018-12-09 16:28:56,044 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-09 16:28:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-09 16:28:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-09 16:28:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-09 16:28:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2018-12-09 16:28:56,047 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 49 [2018-12-09 16:28:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:28:56,048 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2018-12-09 16:28:56,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:28:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2018-12-09 16:28:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 16:28:56,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:28:56,049 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-09 16:28:56,049 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:28:56,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:28:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2080646805, now seen corresponding path program 1 times [2018-12-09 16:28:56,049 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:28:56,050 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:28:56,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:28:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:28:56,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:28:56,172 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-09 16:28:56,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:56,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:28:56,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:28:56,207 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-09 16:28:56,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:28:56,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:28:56,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:28:56,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:28:56,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:28:56,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:28:56,210 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand 6 states. [2018-12-09 16:28:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:28:56,616 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2018-12-09 16:28:56,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:28:56,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-12-09 16:28:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:28:56,618 INFO L225 Difference]: With dead ends: 154 [2018-12-09 16:28:56,618 INFO L226 Difference]: Without dead ends: 154 [2018-12-09 16:28:56,618 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-09 16:28:56,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-09 16:28:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-09 16:28:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-09 16:28:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2018-12-09 16:28:56,621 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 49 [2018-12-09 16:28:56,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:28:56,621 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2018-12-09 16:28:56,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:28:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2018-12-09 16:28:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:28:56,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:28:56,622 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-09 16:28:56,623 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:28:56,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:28:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1953425071, now seen corresponding path program 1 times [2018-12-09 16:28:56,623 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:28:56,623 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:28:56,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:28:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:28:56,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:28:56,776 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-09 16:28:56,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:56,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:28:56,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:28:56,919 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-09 16:28:56,921 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-09 16:28:56,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:56,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:28:56,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:28:56,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-12-09 16:28:56,985 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-09 16:28:56,991 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-09 16:28:56,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:56,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:28:57,009 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-09 16:28:57,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:37 [2018-12-09 16:29:01,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:01,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:01,563 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-09 16:29:01,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:01,634 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-09 16:29:01,637 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-09 16:29:01,641 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-09 16:29:01,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:01,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:01,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 32 treesize of output 30 [2018-12-09 16:29:01,692 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-09 16:29:01,692 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:01,699 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-09 16:29:01,714 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-09 16:29:01,735 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-09 16:29:01,736 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:49, output treesize:73 [2018-12-09 16:29:03,829 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-09 16:29:03,832 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-09 16:29:03,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:03,875 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-09 16:29:03,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:03,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:29:03,964 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-09 16:29:03,967 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-09 16:29:03,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:03,978 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:04,027 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-09 16:29:04,027 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:105, output treesize:129 [2018-12-09 16:29:06,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-09 16:29:06,359 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-09 16:29:06,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:06,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:06,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-09 16:29:06,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:17 [2018-12-09 16:29:06,472 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-09 16:29:06,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:29:10,874 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-09 16:29:11,078 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 64 treesize of output 61 [2018-12-09 16:29:11,083 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 16 treesize of output 20 [2018-12-09 16:29:11,089 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 20 treesize of output 8 [2018-12-09 16:29:11,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:11,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:11,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:11,316 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 53 treesize of output 57 [2018-12-09 16:29:11,321 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 46 treesize of output 44 [2018-12-09 16:29:11,321 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:11,383 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-12-09 16:29:11,383 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:11,434 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:29:11,780 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-09 16:29:11,795 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-09 16:29:11,796 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-09 16:29:11,806 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-09 16:29:11,980 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 64 treesize of output 61 [2018-12-09 16:29:11,983 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 16 treesize of output 20 [2018-12-09 16:29:11,992 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 20 treesize of output 8 [2018-12-09 16:29:11,992 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:11,997 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:12,021 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:12,134 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-09 16:29:12,146 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-09 16:29:12,223 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 56 treesize of output 54 [2018-12-09 16:29:12,224 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:12,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-09 16:29:12,302 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:129, output treesize:117 [2018-12-09 16:29:40,532 WARN L180 SmtUtils]: Spent 12.30 s on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-12-09 16:29:40,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:29:40,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:29:40,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:40,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:40,646 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-09 16:29:40,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:40,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:40,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:29:41,048 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 16:29:41,056 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-09 16:29:41,059 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-09 16:29:41,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:41,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:41,071 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-09 16:29:41,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-12-09 16:29:41,818 WARN L180 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-09 16:29:41,828 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-09 16:29:41,835 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-09 16:29:41,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:41,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:41,850 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-09 16:29:41,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2018-12-09 16:29:51,141 WARN L180 SmtUtils]: Spent 837.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-09 16:29:51,152 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-09 16:29:51,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:51,234 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-09 16:29:51,238 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-09 16:29:51,243 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-09 16:29:51,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:51,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2018-12-09 16:29:51,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-09 16:29:51,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:51,320 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-09 16:29:51,337 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-09 16:29:51,358 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-09 16:29:51,358 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:44, output treesize:63 [2018-12-09 16:29:55,508 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 39 treesize of output 35 [2018-12-09 16:29:55,510 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-09 16:29:55,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,557 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-09 16:29:55,560 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-09 16:29:55,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,594 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-09 16:29:55,595 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:29:55,657 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-09 16:29:55,657 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:81, output treesize:90 [2018-12-09 16:30:02,182 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-09 16:30:02,185 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-09 16:30:02,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:02,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:02,192 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-09 16:30:02,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2018-12-09 16:30:02,196 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-09 16:30:02,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:30:02,440 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-09 16:30:02,584 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-09 16:30:02,601 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-09 16:30:02,779 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 63 treesize of output 60 [2018-12-09 16:30:02,782 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 16 treesize of output 20 [2018-12-09 16:30:02,788 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 20 treesize of output 8 [2018-12-09 16:30:02,788 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:02,791 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:02,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:02,902 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 52 treesize of output 50 [2018-12-09 16:30:02,903 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:03,012 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 60 treesize of output 57 [2018-12-09 16:30:03,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-09 16:30:03,023 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 20 treesize of output 8 [2018-12-09 16:30:03,023 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:03,028 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:03,047 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:03,095 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-09 16:30:03,107 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:30:03,174 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-09 16:30:03,178 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 34 treesize of output 32 [2018-12-09 16:30:03,178 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:03,215 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-12-09 16:30:03,216 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:03,242 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:30:03,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-09 16:30:03,286 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:121, output treesize:103 [2018-12-09 16:30:18,710 WARN L180 SmtUtils]: Spent 9.99 s on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-12-09 16:30:18,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:30:18,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 30 [2018-12-09 16:30:18,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-09 16:30:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-09 16:30:18,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1125, Unknown=21, NotChecked=0, Total=1260 [2018-12-09 16:30:18,726 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand 31 states. [2018-12-09 16:30:33,135 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 60 [2018-12-09 16:30:39,772 WARN L180 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2018-12-09 16:30:46,208 WARN L180 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-12-09 16:30:50,605 WARN L180 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-12-09 16:30:55,168 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-12-09 16:31:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:31:19,988 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2018-12-09 16:31:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 16:31:19,989 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-12-09 16:31:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:31:19,989 INFO L225 Difference]: With dead ends: 174 [2018-12-09 16:31:19,990 INFO L226 Difference]: Without dead ends: 174 [2018-12-09 16:31:19,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 98.8s TimeCoverageRelationStatistics Valid=229, Invalid=2003, Unknown=24, NotChecked=0, Total=2256 [2018-12-09 16:31:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-09 16:31:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2018-12-09 16:31:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-09 16:31:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2018-12-09 16:31:19,993 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 51 [2018-12-09 16:31:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:31:19,994 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2018-12-09 16:31:19,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-09 16:31:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2018-12-09 16:31:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:31:19,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:31:19,994 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-09 16:31:19,994 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:31:19,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:31:19,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1953425072, now seen corresponding path program 1 times [2018-12-09 16:31:19,995 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:31:19,995 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:31:20,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:31:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:31:20,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:31:20,225 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-09 16:31:20,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:31:20,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-09 16:31:20,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:31:20,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:31:20,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:31:22,659 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-09 16:31:22,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:31:22,674 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-09 16:31:22,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:31:22,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:31:22,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:31:22,757 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-09 16:31:22,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:31:22,861 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-09 16:31:22,865 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-09 16:31:22,872 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-09 16:31:22,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:31:22,888 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:31:22,980 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-09 16:31:22,987 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-09 16:31:22,987 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 16:31:23,004 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-09 16:31:23,055 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-09 16:31:23,160 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-09 16:31:23,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-12-09 16:31:23,171 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-09 16:31:23,172 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 16:31:23,180 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:31:23,231 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:31:23,258 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-09 16:31:23,259 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:76, output treesize:82 [2018-12-09 16:31:23,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:31:23,584 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-09 16:31:23,587 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-09 16:31:23,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:31:23,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:31:23,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:31:23,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:31:23,608 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-09 16:31:23,620 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 29 treesize of output 28 [2018-12-09 16:31:23,621 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-09 16:31:23,642 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-09 16:31:23,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:31:23,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:31:23,659 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-09 16:31:23,659 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:68, output treesize:24 [2018-12-09 16:31:23,770 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-09 16:31:23,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:31:24,481 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-09 16:31:24,637 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 16:31:24,713 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-09 16:31:24,742 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-09 16:31:40,899 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-09 16:31:40,940 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-09 16:31:46,186 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-09 16:31:46,216 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-09 16:31:51,974 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-09 16:31:52,006 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-09 16:31:57,371 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-09 16:31:57,391 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-09 16:32:01,951 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-09 16:32:01,997 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-09 16:32:07,879 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-09 16:32:07,898 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-09 16:32:11,002 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:11,011 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:32:13,378 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-09 16:32:13,405 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-09 16:32:14,596 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-09 16:32:14,639 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-09 16:32:15,542 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:15,553 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:32:16,212 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-09 16:32:16,239 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-09 16:32:16,841 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-09 16:32:16,841 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 18 variables, input treesize:389, output treesize:301 [2018-12-09 16:32:25,257 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 135 DAG size of output: 90 [2018-12-09 16:32:25,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:32:25,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:32:25,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:32:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:32:25,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:32:25,420 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-09 16:32:25,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:25,427 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-09 16:32:25,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:25,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:32:25,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:32:27,063 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 22 [2018-12-09 16:32:31,237 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-12-09 16:32:33,264 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-09 16:32:33,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:32:33,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:32:33,287 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-09 16:32:33,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:33,349 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-09 16:32:33,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:33,455 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-09 16:32:33,460 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-09 16:32:33,468 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-09 16:32:33,468 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:33,482 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:32:33,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:32:33,613 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-09 16:32:33,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2018-12-09 16:32:33,620 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-09 16:32:33,621 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:33,630 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:32:33,700 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-09 16:32:33,704 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-09 16:32:33,704 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:33,713 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-09 16:32:33,749 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-09 16:32:33,782 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-09 16:32:33,782 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:78, output treesize:84 [2018-12-09 16:32:34,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:32:34,337 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-09 16:32:34,341 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-09 16:32:34,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:34,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:32:34,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:32:34,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:32:34,369 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-09 16:32:34,379 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 31 treesize of output 30 [2018-12-09 16:32:34,380 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-09 16:32:34,403 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-09 16:32:34,403 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:34,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:32:34,423 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-09 16:32:34,424 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:68, output treesize:24 [2018-12-09 16:32:34,490 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-09 16:32:34,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:32:34,787 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-09 16:32:35,009 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-09 16:32:35,042 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-09 16:32:37,178 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-09 16:32:37,220 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-09 16:32:40,149 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-09 16:32:40,173 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-09 16:32:42,620 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-09 16:32:42,642 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-09 16:32:45,600 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-09 16:32:45,636 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-09 16:32:48,207 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:48,226 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:32:49,865 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-09 16:32:49,892 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-09 16:32:51,593 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-09 16:32:51,613 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-09 16:32:52,841 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-09 16:32:52,855 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-09 16:32:53,811 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 16:32:53,821 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:32:54,481 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-09 16:32:54,515 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-09 16:32:55,279 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-09 16:32:55,301 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-09 16:32:55,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 12 dim-2 vars, End of recursive call: 22 dim-0 vars, and 6 xjuncts. [2018-12-09 16:32:55,932 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 24 variables, input treesize:389, output treesize:301 [2018-12-09 16:33:18,676 WARN L180 SmtUtils]: Spent 9.65 s on a formula simplification. DAG size of input: 147 DAG size of output: 96 [2018-12-09 16:33:18,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:33:18,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 28 [2018-12-09 16:33:18,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 16:33:18,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 16:33:18,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=999, Unknown=10, NotChecked=130, Total=1260 [2018-12-09 16:33:18,693 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand 29 states. [2018-12-09 16:33:24,096 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2018-12-09 16:33:26,779 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-12-09 16:33:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:33:30,067 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2018-12-09 16:33:30,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 16:33:30,068 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-12-09 16:33:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:33:30,069 INFO L225 Difference]: With dead ends: 193 [2018-12-09 16:33:30,069 INFO L226 Difference]: Without dead ends: 193 [2018-12-09 16:33:30,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 50.8s TimeCoverageRelationStatistics Valid=195, Invalid=1694, Unknown=11, NotChecked=170, Total=2070 [2018-12-09 16:33:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-09 16:33:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 162. [2018-12-09 16:33:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-09 16:33:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 183 transitions. [2018-12-09 16:33:30,072 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 183 transitions. Word has length 51 [2018-12-09 16:33:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:33:30,072 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 183 transitions. [2018-12-09 16:33:30,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 16:33:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 183 transitions. [2018-12-09 16:33:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 16:33:30,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:33:30,073 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-09 16:33:30,073 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:33:30,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:33:30,073 INFO L82 PathProgramCache]: Analyzing trace with hash 104159149, now seen corresponding path program 1 times [2018-12-09 16:33:30,073 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:33:30,073 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:33:30,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:33:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:33:30,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:33:30,204 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-09 16:33:30,204 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:33:30,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:33:30,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:33:30,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:33:30,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:33:30,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:33:30,207 INFO L87 Difference]: Start difference. First operand 162 states and 183 transitions. Second operand 5 states. [2018-12-09 16:33:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:33:30,471 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-12-09 16:33:30,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:33:30,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-09 16:33:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:33:30,472 INFO L225 Difference]: With dead ends: 157 [2018-12-09 16:33:30,472 INFO L226 Difference]: Without dead ends: 157 [2018-12-09 16:33:30,472 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-09 16:33:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-09 16:33:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-09 16:33:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-09 16:33:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2018-12-09 16:33:30,474 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 53 [2018-12-09 16:33:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:33:30,474 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2018-12-09 16:33:30,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:33:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2018-12-09 16:33:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 16:33:30,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:33:30,475 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-09 16:33:30,475 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:33:30,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:33:30,475 INFO L82 PathProgramCache]: Analyzing trace with hash 104159150, now seen corresponding path program 1 times [2018-12-09 16:33:30,475 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:33:30,475 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:33:30,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:33:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:33:30,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:33:30,649 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-09 16:33:30,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:33:30,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:33:30,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:33:30,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:33:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:33:30,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:33:30,652 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 6 states. [2018-12-09 16:33:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:33:31,157 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2018-12-09 16:33:31,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:33:31,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 16:33:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:33:31,159 INFO L225 Difference]: With dead ends: 153 [2018-12-09 16:33:31,159 INFO L226 Difference]: Without dead ends: 153 [2018-12-09 16:33:31,160 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-09 16:33:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-09 16:33:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-09 16:33:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-09 16:33:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions. [2018-12-09 16:33:31,163 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 173 transitions. Word has length 53 [2018-12-09 16:33:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:33:31,163 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 173 transitions. [2018-12-09 16:33:31,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:33:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 173 transitions. [2018-12-09 16:33:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 16:33:31,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:33:31,164 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-09 16:33:31,165 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:33:31,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:33:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash -982049502, now seen corresponding path program 1 times [2018-12-09 16:33:31,165 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:33:31,165 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:33:31,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:33:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:33:31,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:33:31,404 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-09 16:33:31,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:31,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:31,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:33:31,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:31,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:31,475 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-09 16:33:31,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:31,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:31,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2018-12-09 16:33:31,603 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-09 16:33:31,606 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-09 16:33:31,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:31,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:31,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:31,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-09 16:33:31,712 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-09 16:33:31,715 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-09 16:33:31,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:31,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:31,734 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-09 16:33:31,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:41 [2018-12-09 16:33:34,334 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-09 16:33:34,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:34,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:34,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:34,360 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 36 treesize of output 80 [2018-12-09 16:33:34,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:34,541 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-09 16:33:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-12-09 16:33:34,559 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-09 16:33:34,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:34,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:34,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:34,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:34,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:34,825 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 98 treesize of output 108 [2018-12-09 16:33:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 123 [2018-12-09 16:33:34,835 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-09 16:33:34,835 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:34,860 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:35,004 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 82 treesize of output 68 [2018-12-09 16:33:35,010 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-09 16:33:35,011 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:35,026 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-09 16:33:35,068 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-09 16:33:35,133 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-09 16:33:35,133 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:117, output treesize:182 [2018-12-09 16:33:35,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:35,664 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-09 16:33:35,668 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-09 16:33:35,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:35,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:35,701 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-09 16:33:35,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:132, output treesize:114 [2018-12-09 16:33:35,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:35,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:35,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:35,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:35,901 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 108 treesize of output 93 [2018-12-09 16:33:35,920 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 84 treesize of output 89 [2018-12-09 16:33:35,920 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 16:33:36,015 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 71 treesize of output 64 [2018-12-09 16:33:36,015 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:36,070 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 72 treesize of output 67 [2018-12-09 16:33:36,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:36,124 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-09 16:33:36,124 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-09 16:33:36,193 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-09 16:33:36,194 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-09 16:33:36,246 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 50 treesize of output 39 [2018-12-09 16:33:36,246 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:36,300 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 54 treesize of output 43 [2018-12-09 16:33:36,300 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:36,364 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-09 16:33:36,439 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-09 16:33:36,439 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:115, output treesize:77 [2018-12-09 16:33:36,676 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-09 16:33:36,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:33:37,292 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-09 16:33:37,497 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-09 16:33:37,543 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-09 16:33:37,787 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-09 16:33:37,820 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-09 16:33:37,970 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-09 16:33:37,994 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-09 16:33:38,118 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-09 16:33:38,140 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-09 16:33:38,219 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-09 16:33:38,219 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:149, output treesize:159 [2018-12-09 16:33:51,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:33:51,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:33:51,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:33:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:33:51,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:33:51,503 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-09 16:33:51,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:51,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:51,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:33:51,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:51,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:51,815 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-09 16:33:51,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:51,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:51,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2018-12-09 16:33:52,009 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-09 16:33:52,011 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-09 16:33:52,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:52,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:52,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:52,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-09 16:33:52,228 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-09 16:33:52,230 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-09 16:33:52,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:52,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:52,247 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-09 16:33:52,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-12-09 16:33:53,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:53,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:53,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:53,187 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 40 treesize of output 96 [2018-12-09 16:33:53,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:53,378 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-12-09 16:33:53,408 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 113 treesize of output 111 [2018-12-09 16:33:53,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 116 [2018-12-09 16:33:53,420 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-09 16:33:53,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:53,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:53,652 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 97 treesize of output 83 [2018-12-09 16:33:53,661 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-09 16:33:53,661 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:53,703 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-09 16:33:53,807 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-09 16:33:53,947 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 120 treesize of output 126 [2018-12-09 16:33:53,953 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 121 treesize of output 123 [2018-12-09 16:33:53,962 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-09 16:33:53,962 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:53,989 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:54,157 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 112 treesize of output 106 [2018-12-09 16:33:54,164 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-09 16:33:54,164 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:54,187 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:33:54,260 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 16:33:54,272 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 91 treesize of output 80 [2018-12-09 16:33:54,279 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-09 16:33:54,287 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-09 16:33:54,287 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:54,300 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-09 16:33:54,323 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:33:54,437 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-09 16:33:54,437 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:122, output treesize:288 [2018-12-09 16:33:54,738 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2018-12-09 16:33:55,421 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 72 [2018-12-09 16:33:55,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:55,433 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 138 treesize of output 130 [2018-12-09 16:33:55,437 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-09 16:33:55,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:55,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:55,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:55,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:55,559 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 138 treesize of output 132 [2018-12-09 16:33:55,572 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-09 16:33:55,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:55,614 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 81 treesize of output 66 [2018-12-09 16:33:55,614 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:55,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:33:55,743 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-09 16:33:55,743 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:277, output treesize:217 [2018-12-09 16:33:56,185 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 112 treesize of output 89 [2018-12-09 16:33:56,192 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 73 treesize of output 62 [2018-12-09 16:33:56,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:56,364 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 65 treesize of output 58 [2018-12-09 16:33:56,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:56,532 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 62 treesize of output 55 [2018-12-09 16:33:56,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:56,686 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 69 treesize of output 57 [2018-12-09 16:33:56,687 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-09 16:33:56,827 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 55 treesize of output 47 [2018-12-09 16:33:56,827 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-09 16:33:56,958 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 54 treesize of output 43 [2018-12-09 16:33:56,958 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:57,105 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-09 16:33:57,105 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-09 16:33:57,210 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2018-12-09 16:33:57,211 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-09 16:33:57,307 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-09 16:33:57,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:57,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:33:57,531 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 112 treesize of output 95 [2018-12-09 16:33:57,551 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 80 treesize of output 85 [2018-12-09 16:33:57,552 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-09 16:33:57,805 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 74 treesize of output 67 [2018-12-09 16:33:57,806 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:57,987 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 80 treesize of output 73 [2018-12-09 16:33:57,988 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:58,189 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 71 treesize of output 60 [2018-12-09 16:33:58,189 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:58,368 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 73 treesize of output 62 [2018-12-09 16:33:58,368 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:58,541 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 62 treesize of output 52 [2018-12-09 16:33:58,541 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-09 16:33:58,727 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 52 treesize of output 47 [2018-12-09 16:33:58,727 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:58,890 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 67 treesize of output 52 [2018-12-09 16:33:58,890 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-09 16:33:59,066 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 52 treesize of output 47 [2018-12-09 16:33:59,066 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:59,208 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 60 treesize of output 46 [2018-12-09 16:33:59,208 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-09 16:33:59,327 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 70 treesize of output 55 [2018-12-09 16:33:59,327 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:33:59,458 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 52 treesize of output 47 [2018-12-09 16:33:59,458 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 16:33:59,626 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-09 16:33:59,915 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-09 16:33:59,916 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 10 variables, input treesize:225, output treesize:269 [2018-12-09 16:34:00,062 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-09 16:34:00,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:34:00,393 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-09 16:34:00,606 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-09 16:34:00,636 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-09 16:34:00,890 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-09 16:34:00,931 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-09 16:34:01,105 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-09 16:34:01,125 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-09 16:34:01,264 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-09 16:34:01,291 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-09 16:34:01,386 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-09 16:34:01,386 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:149, output treesize:157 [2018-12-09 16:34:06,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:34:06,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 48 [2018-12-09 16:34:06,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-09 16:34:06,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-09 16:34:06,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2881, Unknown=5, NotChecked=108, Total=3192 [2018-12-09 16:34:06,825 INFO L87 Difference]: Start difference. First operand 153 states and 173 transitions. Second operand 49 states. [2018-12-09 16:34:15,984 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-12-09 16:34:20,442 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-12-09 16:34:21,664 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-12-09 16:34:24,373 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-12-09 16:34:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:34:26,798 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2018-12-09 16:34:26,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 16:34:26,798 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 56 [2018-12-09 16:34:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:34:26,799 INFO L225 Difference]: With dead ends: 180 [2018-12-09 16:34:26,799 INFO L226 Difference]: Without dead ends: 180 [2018-12-09 16:34:26,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=336, Invalid=4217, Unknown=7, NotChecked=132, Total=4692 [2018-12-09 16:34:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-09 16:34:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 155. [2018-12-09 16:34:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-09 16:34:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 176 transitions. [2018-12-09 16:34:26,803 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 176 transitions. Word has length 56 [2018-12-09 16:34:26,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:34:26,803 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 176 transitions. [2018-12-09 16:34:26,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-09 16:34:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2018-12-09 16:34:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 16:34:26,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:34:26,804 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-09 16:34:26,804 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 16:34:26,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:34:26,804 INFO L82 PathProgramCache]: Analyzing trace with hash -982049501, now seen corresponding path program 1 times [2018-12-09 16:34:26,804 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:34:26,805 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8335da2-f030-4442-aac6-9bf0d57f3513/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-09 16:34:26,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:34:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:34:27,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:34:27,039 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-09 16:34:27,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,046 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-09 16:34:27,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:34:27,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:27,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:27,166 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-09 16:34:27,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,190 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-09 16:34:27,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:35 [2018-12-09 16:34:27,305 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-09 16:34:27,308 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-09 16:34:27,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,342 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-09 16:34:27,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 8 treesize of output 7 [2018-12-09 16:34:27,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-12-09 16:34:27,517 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 79 treesize of output 75 [2018-12-09 16:34:27,522 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-09 16:34:27,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,592 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-09 16:34:27,595 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-09 16:34:27,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:34:27,632 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-09 16:34:27,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:101, output treesize:75 [2018-12-09 16:34:30,392 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-09 16:34:30,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:30,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:30,424 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 31 treesize of output 66 [2018-12-09 16:34:30,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:30,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:30,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:30,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:30,620 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 30 treesize of output 37 [2018-12-09 16:34:30,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:30,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:30,850 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-12-09 16:34:30,886 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-09 16:34:30,894 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-09 16:34:30,905 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-09 16:34:30,905 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:30,939 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:34:31,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:34:31,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:31,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:31,207 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 124 treesize of output 128 [2018-12-09 16:34:31,212 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-09 16:34:31,220 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-09 16:34:31,220 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:31,252 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:34:31,416 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-09 16:34:31,423 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-09 16:34:31,423 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:31,447 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-09 16:34:31,510 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-09 16:34:31,592 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-09 16:34:31,593 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:167, output treesize:222 [2018-12-09 16:34:32,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:32,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:32,594 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-09 16:34:32,599 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 96 treesize of output 87 [2018-12-09 16:34:32,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:32,653 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 39 treesize of output 32 [2018-12-09 16:34:32,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:32,689 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 32 treesize of output 27 [2018-12-09 16:34:32,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:32,720 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-09 16:34:32,720 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:32,747 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-09 16:34:32,747 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:32,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:34:32,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:32,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:32,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:32,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:34:32,811 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-09 16:34:32,815 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 82 treesize of output 75 [2018-12-09 16:34:32,815 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:32,925 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 70 treesize of output 56 [2018-12-09 16:34:32,925 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-09 16:34:32,995 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 53 treesize of output 48 [2018-12-09 16:34:32,995 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:33,056 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 48 treesize of output 37 [2018-12-09 16:34:33,057 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:33,116 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 67 treesize of output 56 [2018-12-09 16:34:33,116 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:33,180 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 56 treesize of output 51 [2018-12-09 16:34:33,180 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 16:34:33,228 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-09 16:34:33,228 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-09 16:34:33,276 INFO L267 ElimStorePlain]: Start of recursive call 8: 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 16:34:33,331 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-09 16:34:33,331 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:172, output treesize:79 [2018-12-09 16:34:33,587 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-09 16:34:33,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:34:35,102 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-09 16:34:35,263 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 16:34:35,347 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-09 16:34:35,401 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-09 16:34:50,899 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-09 16:34:50,943 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-09 16:35:02,872 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-09 16:35:02,906 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-09 16:35:12,783 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-09 16:35:12,822 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-09 16:35:21,009 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-09 16:35:21,048 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-09 16:35:27,330 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-09 16:35:27,393 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-09 16:35:34,655 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-09 16:35:34,684 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-09 16:35:40,233 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-09 16:35:40,258 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-09 16:35:44,517 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-09 16:35:44,563 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-09 16:35:47,264 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-09 16:35:47,290 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-09 16:35:49,457 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-09 16:35:49,492 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-09 16:35:50,916 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-09 16:35:50,949 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-09 16:35:51,977 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-09 16:35:51,977 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 18 variables, input treesize:469, output treesize:637 [2018-12-09 16:36:15,570 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 16:36:15,771 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:36:15,772 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.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) 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) ... 46 more [2018-12-09 16:36:15,777 INFO L168 Benchmark]: Toolchain (without parser) took 793151.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 939.3 MB in the beginning and 971.0 MB in the end (delta: -31.6 MB). Peak memory consumption was 88.4 MB. Max. memory is 11.5 GB. [2018-12-09 16:36:15,778 INFO L168 Benchmark]: CDTParser took 0.26 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-09 16:36:15,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-09 16:36:15,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.52 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-09 16:36:15,779 INFO L168 Benchmark]: Boogie Preprocessor took 23.37 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 16:36:15,779 INFO L168 Benchmark]: RCFGBuilder took 414.23 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: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-12-09 16:36:15,779 INFO L168 Benchmark]: TraceAbstraction took 792381.60 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -15.7 MB). Free memory was 1.1 GB in the beginning and 971.0 MB in the end (delta: 91.4 MB). Peak memory consumption was 75.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:36:15,780 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.26 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 309.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.52 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 23.37 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 414.23 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: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 792381.60 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -15.7 MB). Free memory was 1.1 GB in the beginning and 971.0 MB in the end (delta: 91.4 MB). Peak memory consumption was 75.7 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...