./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4f285607323e922caa9bbc912c8526475badf88 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4f285607323e922caa9bbc912c8526475badf88 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 01:40:41,088 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:40:41,090 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:40:41,098 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:40:41,099 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:40:41,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:40:41,100 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:40:41,102 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:40:41,103 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:40:41,103 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:40:41,104 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:40:41,104 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:40:41,105 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:40:41,106 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:40:41,106 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:40:41,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:40:41,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:40:41,109 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:40:41,110 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:40:41,111 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:40:41,112 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:40:41,113 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:40:41,115 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:40:41,115 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:40:41,115 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:40:41,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:40:41,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:40:41,116 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:40:41,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:40:41,117 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:40:41,117 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:40:41,118 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:40:41,118 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:40:41,118 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:40:41,118 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:40:41,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:40:41,119 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 01:40:41,126 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:40:41,126 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:40:41,126 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:40:41,126 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:40:41,127 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:40:41,127 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:40:41,127 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:40:41,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:40:41,127 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:40:41,127 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:40:41,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:40:41,127 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:40:41,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:40:41,128 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:40:41,128 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:40:41,128 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:40:41,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:40:41,128 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:40:41,128 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:40:41,128 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:40:41,128 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:40:41,128 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:40:41,128 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:40:41,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:40:41,129 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:40:41,129 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:40:41,129 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:40:41,129 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:40:41,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer 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 -> Automizer 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 -> a4f285607323e922caa9bbc912c8526475badf88 [2018-12-09 01:40:41,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:40:41,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:40:41,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:40:41,159 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:40:41,159 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:40:41,160 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:40:41,195 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/data/644affbce/1355888ba57849db820846c8aafbf50c/FLAG74c77842e [2018-12-09 01:40:41,681 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:40:41,681 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:40:41,687 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/data/644affbce/1355888ba57849db820846c8aafbf50c/FLAG74c77842e [2018-12-09 01:40:41,695 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/data/644affbce/1355888ba57849db820846c8aafbf50c [2018-12-09 01:40:41,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:40:41,698 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 01:40:41,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:40:41,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:40:41,700 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:40:41,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:40:41" (1/1) ... [2018-12-09 01:40:41,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586b3ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:41, skipping insertion in model container [2018-12-09 01:40:41,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:40:41" (1/1) ... [2018-12-09 01:40:41,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:40:41,725 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:40:41,871 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:40:41,909 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:40:41,935 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:40:41,957 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:40:41,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:41 WrapperNode [2018-12-09 01:40:41,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:40:41,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:40:41,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:40:41,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:40:41,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:41" (1/1) ... [2018-12-09 01:40:41,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:41" (1/1) ... [2018-12-09 01:40:41,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:41" (1/1) ... [2018-12-09 01:40:41,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:41" (1/1) ... [2018-12-09 01:40:41,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:41" (1/1) ... [2018-12-09 01:40:41,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:41" (1/1) ... [2018-12-09 01:40:41,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:41" (1/1) ... [2018-12-09 01:40:41,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:40:41,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:40:41,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:40:41,991 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:40:41,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:40:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:40:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:40:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 01:40:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 01:40:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 01:40:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 01:40:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-09 01:40:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-09 01:40:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-12-09 01:40:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 01:40:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 01:40:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 01:40:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 01:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 01:40:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 01:40:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:40:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:40:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-09 01:40:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-09 01:40:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 01:40:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:40:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-12-09 01:40:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:40:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 01:40:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:40:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:40:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:40:42,335 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:40:42,335 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 01:40:42,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:40:42 BoogieIcfgContainer [2018-12-09 01:40:42,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:40:42,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:40:42,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:40:42,338 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:40:42,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:40:41" (1/3) ... [2018-12-09 01:40:42,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e55c11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:40:42, skipping insertion in model container [2018-12-09 01:40:42,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:41" (2/3) ... [2018-12-09 01:40:42,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e55c11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:40:42, skipping insertion in model container [2018-12-09 01:40:42,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:40:42" (3/3) ... [2018-12-09 01:40:42,341 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:40:42,347 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:40:42,352 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-09 01:40:42,362 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-09 01:40:42,377 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:40:42,378 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:40:42,378 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:40:42,378 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:40:42,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:40:42,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:40:42,378 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:40:42,378 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:40:42,378 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:40:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-12-09 01:40:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 01:40:42,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:40:42,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:40:42,398 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:40:42,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash -135111568, now seen corresponding path program 1 times [2018-12-09 01:40:42,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:42,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:42,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:42,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:42,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:42,518 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 01:40:42,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:40:42,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:40:42,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:40:42,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:40:42,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:40:42,532 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-12-09 01:40:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:42,620 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2018-12-09 01:40:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:40:42,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 01:40:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:40:42,628 INFO L225 Difference]: With dead ends: 108 [2018-12-09 01:40:42,628 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 01:40:42,629 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 01:40:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 01:40:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-09 01:40:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 01:40:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-09 01:40:42,659 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 13 [2018-12-09 01:40:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:40:42,659 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-09 01:40:42,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:40:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-09 01:40:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 01:40:42,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:40:42,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:40:42,660 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:40:42,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:42,660 INFO L82 PathProgramCache]: Analyzing trace with hash -135111567, now seen corresponding path program 1 times [2018-12-09 01:40:42,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:42,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:42,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:42,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:42,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:42,712 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 01:40:42,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:40:42,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:40:42,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:40:42,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:40:42,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:40:42,714 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 3 states. [2018-12-09 01:40:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:42,767 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-12-09 01:40:42,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:40:42,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 01:40:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:40:42,768 INFO L225 Difference]: With dead ends: 98 [2018-12-09 01:40:42,768 INFO L226 Difference]: Without dead ends: 98 [2018-12-09 01:40:42,769 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 01:40:42,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-09 01:40:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-09 01:40:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 01:40:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-09 01:40:42,774 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 13 [2018-12-09 01:40:42,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:40:42,774 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-09 01:40:42,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:40:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-09 01:40:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:40:42,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:40:42,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:40:42,775 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:40:42,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:42,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1235500660, now seen corresponding path program 1 times [2018-12-09 01:40:42,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:42,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:42,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:42,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:42,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:42,824 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 01:40:42,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:40:42,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:40:42,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:40:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:40:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:40:42,825 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 6 states. [2018-12-09 01:40:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:42,939 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-12-09 01:40:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:40:42,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 01:40:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:40:42,941 INFO L225 Difference]: With dead ends: 101 [2018-12-09 01:40:42,941 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 01:40:42,942 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 01:40:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 01:40:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-12-09 01:40:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 01:40:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-12-09 01:40:42,947 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 20 [2018-12-09 01:40:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:40:42,948 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-12-09 01:40:42,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:40:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-12-09 01:40:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:40:42,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:40:42,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:40:42,948 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:40:42,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:42,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1235500659, now seen corresponding path program 1 times [2018-12-09 01:40:42,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:42,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:42,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:42,998 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 01:40:42,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:40:42,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:40:42,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:40:42,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:40:42,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:40:42,999 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 6 states. [2018-12-09 01:40:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:43,107 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-12-09 01:40:43,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:40:43,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 01:40:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:40:43,108 INFO L225 Difference]: With dead ends: 99 [2018-12-09 01:40:43,108 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 01:40:43,108 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 01:40:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 01:40:43,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2018-12-09 01:40:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-09 01:40:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-12-09 01:40:43,114 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 20 [2018-12-09 01:40:43,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:40:43,114 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-12-09 01:40:43,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:40:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-12-09 01:40:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:40:43,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:40:43,115 INFO L402 BasicCegarLoop]: trace histogram [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 01:40:43,115 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:40:43,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:43,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1069690932, now seen corresponding path program 1 times [2018-12-09 01:40:43,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:43,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:43,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:43,146 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 01:40:43,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:40:43,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:40:43,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:40:43,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:40:43,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:40:43,147 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 3 states. [2018-12-09 01:40:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:43,162 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-12-09 01:40:43,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:40:43,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 01:40:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:40:43,163 INFO L225 Difference]: With dead ends: 104 [2018-12-09 01:40:43,163 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 01:40:43,163 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 01:40:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 01:40:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-12-09 01:40:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 01:40:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-09 01:40:43,168 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 23 [2018-12-09 01:40:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:40:43,169 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-09 01:40:43,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:40:43,169 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-09 01:40:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 01:40:43,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:40:43,170 INFO L402 BasicCegarLoop]: trace histogram [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 01:40:43,170 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:40:43,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash 451964586, now seen corresponding path program 1 times [2018-12-09 01:40:43,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:43,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:43,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:43,207 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 01:40:43,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:40:43,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:40:43,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:40:43,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:40:43,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:40:43,209 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 5 states. [2018-12-09 01:40:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:43,229 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-12-09 01:40:43,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:40:43,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-09 01:40:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:40:43,230 INFO L225 Difference]: With dead ends: 104 [2018-12-09 01:40:43,230 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 01:40:43,230 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 01:40:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 01:40:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-09 01:40:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 01:40:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-12-09 01:40:43,233 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 26 [2018-12-09 01:40:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:40:43,233 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-12-09 01:40:43,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:40:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-12-09 01:40:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 01:40:43,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:40:43,234 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:40:43,234 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:40:43,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1664970008, now seen corresponding path program 1 times [2018-12-09 01:40:43,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:43,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:43,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:43,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:43,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:43,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:40:43,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:40:43,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:43,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:45,124 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 12 treesize of output 11 [2018-12-09 01:40:45,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:40:45,128 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 01:40:45,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 01:40:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:45,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:40:45,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-12-09 01:40:45,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 01:40:45,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 01:40:45,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=117, Unknown=5, NotChecked=0, Total=156 [2018-12-09 01:40:45,152 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 13 states. [2018-12-09 01:40:45,477 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 01:40:45,745 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 01:40:46,113 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 01:40:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:56,890 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2018-12-09 01:40:56,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:40:56,890 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-12-09 01:40:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:40:56,891 INFO L225 Difference]: With dead ends: 117 [2018-12-09 01:40:56,891 INFO L226 Difference]: Without dead ends: 117 [2018-12-09 01:40:56,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=78, Invalid=297, Unknown=5, NotChecked=0, Total=380 [2018-12-09 01:40:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-09 01:40:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-12-09 01:40:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 01:40:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-12-09 01:40:56,894 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 38 [2018-12-09 01:40:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:40:56,894 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-12-09 01:40:56,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 01:40:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-12-09 01:40:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 01:40:56,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:40:56,895 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:40:56,896 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:40:56,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1664970009, now seen corresponding path program 1 times [2018-12-09 01:40:56,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:56,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:56,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:57,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:40:57,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:40:57,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:57,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:57,051 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 01:40:57,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:40:57,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:40:57,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:40:57,299 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int)) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base 12))) is different from true [2018-12-09 01:40:57,305 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 12 treesize of output 11 [2018-12-09 01:40:57,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:40:57,309 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 01:40:57,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-09 01:40:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 01:40:57,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:40:57,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2018-12-09 01:40:57,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:40:57,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:40:57,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2018-12-09 01:40:57,337 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 12 states. [2018-12-09 01:40:57,844 WARN L180 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-12-09 01:40:58,358 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-12-09 01:40:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:58,616 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-12-09 01:40:58,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:40:58,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-12-09 01:40:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:40:58,617 INFO L225 Difference]: With dead ends: 104 [2018-12-09 01:40:58,617 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 01:40:58,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=64, Invalid=245, Unknown=1, NotChecked=32, Total=342 [2018-12-09 01:40:58,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 01:40:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-12-09 01:40:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 01:40:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-12-09 01:40:58,621 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 38 [2018-12-09 01:40:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:40:58,621 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-12-09 01:40:58,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:40:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-12-09 01:40:58,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 01:40:58,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:40:58,622 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:40:58,623 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:40:58,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash 490952518, now seen corresponding path program 1 times [2018-12-09 01:40:58,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:58,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:58,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:40:58,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:40:58,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:40:58,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:58,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:58,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:40:58,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 01:40:58,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:40:58,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:40:58,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:40:58,716 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 6 states. [2018-12-09 01:40:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:58,738 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-12-09 01:40:58,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:40:58,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-12-09 01:40:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:40:58,739 INFO L225 Difference]: With dead ends: 110 [2018-12-09 01:40:58,739 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 01:40:58,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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 01:40:58,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 01:40:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2018-12-09 01:40:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 01:40:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-12-09 01:40:58,742 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 41 [2018-12-09 01:40:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:40:58,742 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-12-09 01:40:58,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:40:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-12-09 01:40:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 01:40:58,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:40:58,743 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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 01:40:58,743 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:40:58,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:58,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1834573014, now seen corresponding path program 2 times [2018-12-09 01:40:58,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:58,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:58,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:58,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:58,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:40:58,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:40:58,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:40:58,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:40:58,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:40:58,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:40:58,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:40:58,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:40:58,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 9 [2018-12-09 01:40:58,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:40:58,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:40:58,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:40:58,912 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 9 states. [2018-12-09 01:40:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:58,978 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-12-09 01:40:58,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:40:58,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-12-09 01:40:58,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:40:58,978 INFO L225 Difference]: With dead ends: 100 [2018-12-09 01:40:58,978 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 01:40:58,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:40:58,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 01:40:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-09 01:40:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 01:40:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-09 01:40:58,981 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 56 [2018-12-09 01:40:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:40:58,981 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-09 01:40:58,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:40:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-09 01:40:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 01:40:58,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:40:58,982 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:40:58,982 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:40:58,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:58,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1786613404, now seen corresponding path program 1 times [2018-12-09 01:40:58,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:58,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:58,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:58,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:40:58,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 01:40:59,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:40:59,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:40:59,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:59,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:59,189 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 01:40:59,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:40:59,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:40:59,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:40:59,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:40:59,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:40:59,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:40:59,285 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-12-09 01:40:59,287 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 28 treesize of output 34 [2018-12-09 01:40:59,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:40:59,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:40:59,298 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 01:40:59,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:28 [2018-12-09 01:41:02,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-09 01:41:02,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:02,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:41:02,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2018-12-09 01:41:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:41:02,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:41:02,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-12-09 01:41:02,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 01:41:02,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 01:41:02,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=267, Unknown=7, NotChecked=0, Total=342 [2018-12-09 01:41:02,615 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 19 states. [2018-12-09 01:41:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:09,681 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2018-12-09 01:41:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 01:41:09,681 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-12-09 01:41:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:09,682 INFO L225 Difference]: With dead ends: 168 [2018-12-09 01:41:09,682 INFO L226 Difference]: Without dead ends: 168 [2018-12-09 01:41:09,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=132, Invalid=461, Unknown=7, NotChecked=0, Total=600 [2018-12-09 01:41:09,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-09 01:41:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 127. [2018-12-09 01:41:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-09 01:41:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2018-12-09 01:41:09,686 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 57 [2018-12-09 01:41:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:09,687 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2018-12-09 01:41:09,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 01:41:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2018-12-09 01:41:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 01:41:09,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:09,688 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:09,688 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:41:09,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:09,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1786613403, now seen corresponding path program 1 times [2018-12-09 01:41:09,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:09,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:09,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:09,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:09,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:41:10,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:41:10,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:41:10,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:10,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:10,089 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 01:41:10,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:10,097 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 01:41:10,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:10,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:10,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:41:10,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:10,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:10,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 01:41:10,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:10,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-09 01:41:10,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:10,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:10,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:10,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:10,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:10,396 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-12-09 01:41:10,399 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 30 treesize of output 34 [2018-12-09 01:41:10,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:10,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:10,415 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 01:41:10,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:38 [2018-12-09 01:41:11,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:11,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:11,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:11,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:11,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:11,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:11,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-09 01:41:11,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:11,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:11,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:11,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:11,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 53 [2018-12-09 01:41:11,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:11,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:41:11,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:36 [2018-12-09 01:41:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 01:41:11,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:41:11,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-12-09 01:41:11,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 01:41:11,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 01:41:11,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=734, Unknown=2, NotChecked=0, Total=870 [2018-12-09 01:41:11,562 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand 30 states. [2018-12-09 01:41:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:12,913 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2018-12-09 01:41:12,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 01:41:12,913 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2018-12-09 01:41:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:12,914 INFO L225 Difference]: With dead ends: 162 [2018-12-09 01:41:12,914 INFO L226 Difference]: Without dead ends: 162 [2018-12-09 01:41:12,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=202, Invalid=1056, Unknown=2, NotChecked=0, Total=1260 [2018-12-09 01:41:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-09 01:41:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 135. [2018-12-09 01:41:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-09 01:41:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2018-12-09 01:41:12,919 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 57 [2018-12-09 01:41:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:12,920 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2018-12-09 01:41:12,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 01:41:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2018-12-09 01:41:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 01:41:12,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:12,921 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:12,921 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 01:41:12,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1114162858, now seen corresponding path program 1 times [2018-12-09 01:41:12,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:12,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:12,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:12,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:12,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:41:13,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:41:13,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:13,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:13,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:13,457 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 01:41:13,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:13,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:13,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:41:13,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:41:13,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-09 01:41:13,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:122, output treesize:88 [2018-12-09 01:41:13,894 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:41:13,895 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 50052 column 44: unknown constant v_DerPreprocessor_1 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$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:164) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:174) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:320) 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.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:112) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:82) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) 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) [2018-12-09 01:41:13,901 INFO L168 Benchmark]: Toolchain (without parser) took 32203.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -80.6 MB). Peak memory consumption was 228.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:41:13,903 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:41:13,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:41:13,904 INFO L168 Benchmark]: Boogie Preprocessor took 32.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:41:13,905 INFO L168 Benchmark]: RCFGBuilder took 344.44 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: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:41:13,906 INFO L168 Benchmark]: TraceAbstraction took 31563.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 192.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:41:13,911 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 344.44 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: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31563.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 192.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 50052 column 44: unknown constant v_DerPreprocessor_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 50052 column 44: unknown constant v_DerPreprocessor_1: 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 01:41:15,232 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:41:15,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:41:15,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:41:15,239 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:41:15,239 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:41:15,240 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:41:15,241 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:41:15,242 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:41:15,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:41:15,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:41:15,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:41:15,243 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:41:15,244 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:41:15,244 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:41:15,244 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:41:15,245 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:41:15,246 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:41:15,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:41:15,248 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:41:15,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:41:15,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:41:15,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:41:15,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:41:15,251 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:41:15,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:41:15,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:41:15,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:41:15,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:41:15,253 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:41:15,254 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:41:15,254 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:41:15,254 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:41:15,254 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:41:15,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:41:15,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:41:15,256 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-09 01:41:15,265 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:41:15,265 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:41:15,266 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:41:15,266 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:41:15,266 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:41:15,267 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:41:15,267 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:41:15,267 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:41:15,267 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:41:15,267 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:41:15,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:41:15,267 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:41:15,268 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:41:15,268 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:41:15,268 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:41:15,268 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:41:15,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:41:15,268 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 01:41:15,268 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 01:41:15,268 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:41:15,269 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:41:15,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:41:15,269 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:41:15,269 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:41:15,269 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:41:15,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:41:15,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:41:15,270 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:41:15,270 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-09 01:41:15,270 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:41:15,270 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 01:41:15,270 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_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer 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 -> Automizer 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 -> a4f285607323e922caa9bbc912c8526475badf88 [2018-12-09 01:41:15,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:41:15,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:41:15,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:41:15,305 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:41:15,305 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:41:15,306 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:41:15,343 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/data/5af65ce2a/799fe802b22e465698520f3f82e955ba/FLAGb631c866d [2018-12-09 01:41:15,811 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:41:15,811 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:41:15,817 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/data/5af65ce2a/799fe802b22e465698520f3f82e955ba/FLAGb631c866d [2018-12-09 01:41:16,327 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/data/5af65ce2a/799fe802b22e465698520f3f82e955ba [2018-12-09 01:41:16,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:41:16,332 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 01:41:16,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:41:16,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:41:16,335 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:41:16,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:41:16" (1/1) ... [2018-12-09 01:41:16,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc15be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:16, skipping insertion in model container [2018-12-09 01:41:16,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:41:16" (1/1) ... [2018-12-09 01:41:16,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:41:16,368 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:41:16,535 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:41:16,543 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:41:16,599 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:41:16,622 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:41:16,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:16 WrapperNode [2018-12-09 01:41:16,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:41:16,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:41:16,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:41:16,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:41:16,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:16" (1/1) ... [2018-12-09 01:41:16,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:16" (1/1) ... [2018-12-09 01:41:16,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:16" (1/1) ... [2018-12-09 01:41:16,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:16" (1/1) ... [2018-12-09 01:41:16,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:16" (1/1) ... [2018-12-09 01:41:16,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:16" (1/1) ... [2018-12-09 01:41:16,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:16" (1/1) ... [2018-12-09 01:41:16,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:41:16,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:41:16,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:41:16,658 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:41:16,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:16,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:41:16,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:41:16,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 01:41:16,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 01:41:16,689 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 01:41:16,689 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 01:41:16,689 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-09 01:41:16,689 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-09 01:41:16,689 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-12-09 01:41:16,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:41:16,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 01:41:16,689 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 01:41:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 01:41:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 01:41:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 01:41:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 01:41:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 01:41:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 01:41:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 01:41:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-09 01:41:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-09 01:41:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 01:41:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:41:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-12-09 01:41:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:41:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 01:41:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 01:41:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:41:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:41:17,088 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:41:17,088 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 01:41:17,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:41:17 BoogieIcfgContainer [2018-12-09 01:41:17,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:41:17,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:41:17,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:41:17,091 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:41:17,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:41:16" (1/3) ... [2018-12-09 01:41:17,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c39aad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:41:17, skipping insertion in model container [2018-12-09 01:41:17,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:16" (2/3) ... [2018-12-09 01:41:17,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c39aad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:41:17, skipping insertion in model container [2018-12-09 01:41:17,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:41:17" (3/3) ... [2018-12-09 01:41:17,093 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:41:17,099 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:41:17,104 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-09 01:41:17,114 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-09 01:41:17,129 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:41:17,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:41:17,130 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:41:17,130 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:41:17,130 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:41:17,130 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:41:17,130 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:41:17,130 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:41:17,130 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:41:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-12-09 01:41:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 01:41:17,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:17,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:17,148 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:41:17,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:17,152 INFO L82 PathProgramCache]: Analyzing trace with hash -135111568, now seen corresponding path program 1 times [2018-12-09 01:41:17,154 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:41:17,155 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:17,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:17,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:17,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:41:17,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:17,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:17,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:41:17,269 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 01:41:17,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:41:17,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:17,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:41:17,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:41:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:41:17,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:41:17,283 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-12-09 01:41:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:17,464 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2018-12-09 01:41:17,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:41:17,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 01:41:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:17,475 INFO L225 Difference]: With dead ends: 108 [2018-12-09 01:41:17,475 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 01:41:17,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:41:17,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 01:41:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-09 01:41:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 01:41:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-09 01:41:17,513 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 13 [2018-12-09 01:41:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:17,513 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-09 01:41:17,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:41:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-09 01:41:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 01:41:17,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:17,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:17,515 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:41:17,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:17,515 INFO L82 PathProgramCache]: Analyzing trace with hash -135111567, now seen corresponding path program 1 times [2018-12-09 01:41:17,515 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:41:17,516 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:17,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:17,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:17,567 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 01:41:17,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:17,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:17,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:41:17,579 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 01:41:17,579 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:41:17,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:17,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:41:17,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:41:17,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:41:17,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:41:17,583 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 3 states. [2018-12-09 01:41:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:17,736 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-12-09 01:41:17,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:41:17,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 01:41:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:17,738 INFO L225 Difference]: With dead ends: 98 [2018-12-09 01:41:17,738 INFO L226 Difference]: Without dead ends: 98 [2018-12-09 01:41:17,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:41:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-09 01:41:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-09 01:41:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 01:41:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-09 01:41:17,744 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 13 [2018-12-09 01:41:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:17,744 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-09 01:41:17,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:41:17,744 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-09 01:41:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:41:17,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:17,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:17,745 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:41:17,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:17,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1235500660, now seen corresponding path program 1 times [2018-12-09 01:41:17,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:41:17,745 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:17,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:17,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:17,805 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 01:41:17,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:17,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:17,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:41:17,828 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 01:41:17,829 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:41:17,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:17,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:41:17,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:41:17,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:41:17,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:41:17,831 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 6 states. [2018-12-09 01:41:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:18,182 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-12-09 01:41:18,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:41:18,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 01:41:18,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:18,184 INFO L225 Difference]: With dead ends: 101 [2018-12-09 01:41:18,185 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 01:41:18,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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 01:41:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 01:41:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-12-09 01:41:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 01:41:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-12-09 01:41:18,193 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 20 [2018-12-09 01:41:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:18,193 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-12-09 01:41:18,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:41:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-12-09 01:41:18,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:41:18,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:18,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:18,194 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:41:18,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:18,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1235500659, now seen corresponding path program 1 times [2018-12-09 01:41:18,195 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:41:18,195 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:18,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:18,258 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 01:41:18,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:18,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:18,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:41:18,329 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 01:41:18,330 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:41:18,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:18,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:41:18,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:41:18,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:41:18,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:41:18,332 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 6 states. [2018-12-09 01:41:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:18,703 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-12-09 01:41:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:41:18,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 01:41:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:18,704 INFO L225 Difference]: With dead ends: 99 [2018-12-09 01:41:18,704 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 01:41:18,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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 01:41:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 01:41:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2018-12-09 01:41:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-09 01:41:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-12-09 01:41:18,709 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 20 [2018-12-09 01:41:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:18,709 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-12-09 01:41:18,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:41:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-12-09 01:41:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:41:18,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:18,710 INFO L402 BasicCegarLoop]: trace histogram [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 01:41:18,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:41:18,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:18,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1069690932, now seen corresponding path program 1 times [2018-12-09 01:41:18,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:41:18,711 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:18,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:18,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:18,758 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 01:41:18,758 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:41:18,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:18,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:41:18,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:41:18,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:41:18,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:41:18,761 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 3 states. [2018-12-09 01:41:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:18,790 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-12-09 01:41:18,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:41:18,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 01:41:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:18,792 INFO L225 Difference]: With dead ends: 104 [2018-12-09 01:41:18,792 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 01:41:18,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 01:41:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 01:41:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-12-09 01:41:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 01:41:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-09 01:41:18,796 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 23 [2018-12-09 01:41:18,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:18,796 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-09 01:41:18,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:41:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-09 01:41:18,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 01:41:18,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:18,797 INFO L402 BasicCegarLoop]: trace histogram [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 01:41:18,797 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:41:18,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash 451964586, now seen corresponding path program 1 times [2018-12-09 01:41:18,797 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:41:18,797 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:18,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:18,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:18,868 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 01:41:18,868 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:41:18,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:18,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:41:18,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:41:18,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:41:18,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:41:18,871 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 5 states. [2018-12-09 01:41:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:18,893 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-12-09 01:41:18,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:41:18,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-09 01:41:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:18,894 INFO L225 Difference]: With dead ends: 104 [2018-12-09 01:41:18,894 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 01:41:18,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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 01:41:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 01:41:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-09 01:41:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 01:41:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-12-09 01:41:18,898 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 26 [2018-12-09 01:41:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:18,898 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-12-09 01:41:18,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:41:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-12-09 01:41:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 01:41:18,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:18,899 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:18,900 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:41:18,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1664970008, now seen corresponding path program 1 times [2018-12-09 01:41:18,900 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:41:18,900 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:41:18,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:19,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:19,018 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 01:41:19,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:19,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:19,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:41:19,445 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 01:41:19,454 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 01:41:19,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:19,458 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 01:41:19,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-09 01:41:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 01:41:19,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:41:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 4 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:41:19,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:41:19,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-12-09 01:41:19,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:41:19,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:41:19,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=51, Unknown=7, NotChecked=14, Total=90 [2018-12-09 01:41:19,583 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 10 states. [2018-12-09 01:41:20,532 WARN L180 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-09 01:41:21,644 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2018-12-09 01:41:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:24,521 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2018-12-09 01:41:24,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:41:24,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-12-09 01:41:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:24,523 INFO L225 Difference]: With dead ends: 134 [2018-12-09 01:41:24,523 INFO L226 Difference]: Without dead ends: 134 [2018-12-09 01:41:24,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=58, Invalid=203, Unknown=15, NotChecked=30, Total=306 [2018-12-09 01:41:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-09 01:41:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2018-12-09 01:41:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 01:41:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-12-09 01:41:24,526 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 38 [2018-12-09 01:41:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:24,527 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-12-09 01:41:24,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:41:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-12-09 01:41:24,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 01:41:24,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:24,527 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:24,528 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:41:24,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1664970009, now seen corresponding path program 1 times [2018-12-09 01:41:24,528 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:41:24,528 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:24,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:24,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:24,676 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 01:41:24,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:24,687 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 01:41:24,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:24,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:24,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:41:26,760 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_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))))) is different from true [2018-12-09 01:41:26,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:26,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:26,770 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 01:41:26,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:26,781 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 14 treesize of output 17 [2018-12-09 01:41:26,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:26,789 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 01:41:26,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-09 01:41:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 01:41:26,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:41:26,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:41:26,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:26,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:27,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:27,007 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 01:41:27,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:27,015 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 01:41:27,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:27,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:27,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:41:27,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:27,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:27,045 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 01:41:27,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:27,055 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 14 treesize of output 17 [2018-12-09 01:41:27,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:27,062 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 01:41:27,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-09 01:41:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 01:41:27,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:41:27,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:41:27,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-09 01:41:27,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:41:27,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:41:27,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=1, NotChecked=18, Total=132 [2018-12-09 01:41:27,182 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 10 states. [2018-12-09 01:41:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:28,252 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-12-09 01:41:28,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:41:28,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-12-09 01:41:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:28,253 INFO L225 Difference]: With dead ends: 116 [2018-12-09 01:41:28,253 INFO L226 Difference]: Without dead ends: 116 [2018-12-09 01:41:28,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=60, Invalid=215, Unknown=1, NotChecked=30, Total=306 [2018-12-09 01:41:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-09 01:41:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2018-12-09 01:41:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 01:41:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-12-09 01:41:28,257 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 38 [2018-12-09 01:41:28,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:28,258 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-12-09 01:41:28,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:41:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-12-09 01:41:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 01:41:28,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:28,258 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:28,258 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:41:28,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:28,259 INFO L82 PathProgramCache]: Analyzing trace with hash 490952518, now seen corresponding path program 1 times [2018-12-09 01:41:28,259 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:41:28,259 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:28,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:28,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:41:28,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:41:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:41:28,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:41:28,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-12-09 01:41:28,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:41:28,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:41:28,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:41:28,470 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 9 states. [2018-12-09 01:41:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:28,559 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-12-09 01:41:28,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:41:28,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-12-09 01:41:28,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:28,560 INFO L225 Difference]: With dead ends: 110 [2018-12-09 01:41:28,560 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 01:41:28,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:41:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 01:41:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2018-12-09 01:41:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 01:41:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-12-09 01:41:28,562 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 41 [2018-12-09 01:41:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:28,562 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-12-09 01:41:28,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:41:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-12-09 01:41:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 01:41:28,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:28,563 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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 01:41:28,563 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:41:28,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:28,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1834573014, now seen corresponding path program 2 times [2018-12-09 01:41:28,564 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:41:28,564 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:41:28,578 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 01:41:28,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:41:28,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:41:28,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:41:28,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:41:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:41:28,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:41:28,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 01:41:28,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:41:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:41:28,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:41:28,746 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 7 states. [2018-12-09 01:41:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:28,952 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-12-09 01:41:28,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:41:28,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-12-09 01:41:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:28,953 INFO L225 Difference]: With dead ends: 100 [2018-12-09 01:41:28,953 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 01:41:28,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:41:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 01:41:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-09 01:41:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 01:41:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-09 01:41:28,956 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 56 [2018-12-09 01:41:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:28,956 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-09 01:41:28,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:41:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-09 01:41:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 01:41:28,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:28,957 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:28,957 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:41:28,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1786613404, now seen corresponding path program 1 times [2018-12-09 01:41:28,958 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:41:28,958 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:28,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:41:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:29,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:29,262 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 01:41:29,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:29,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:29,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:41:31,274 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 01:41:33,289 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-09 01:41:36,591 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 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) is different from true [2018-12-09 01:41:37,062 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 01:41:37,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:37,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:37,073 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 01:41:37,078 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 01:41:37,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:37,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:37,092 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 01:41:37,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-09 01:41:37,534 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 01:41:37,542 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 01:41:37,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:37,555 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 01:41:37,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-12-09 01:41:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 2 refuted. 3 times theorem prover too weak. 3 trivial. 25 not checked. [2018-12-09 01:41:37,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:41:45,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:41:45,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:41:45,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:45,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:41:45,887 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 01:41:45,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:45,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:45,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:41:47,969 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-09 01:41:48,706 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)) (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) is different from true [2018-12-09 01:41:58,978 WARN L180 SmtUtils]: Spent 836.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-09 01:41:58,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:58,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:41:58,988 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 01:41:58,994 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 01:41:58,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:59,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:41:59,007 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 01:41:59,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-09 01:41:59,027 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 01:41:59,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:41:59,035 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 01:41:59,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-12-09 01:41:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2018-12-09 01:41:59,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:42:07,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:42:07,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 20 [2018-12-09 01:42:07,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 01:42:07,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 01:42:07,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=274, Unknown=25, NotChecked=234, Total=600 [2018-12-09 01:42:07,339 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 21 states. [2018-12-09 01:42:42,276 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)) (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) |c_dll_create_#t~ret3.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 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base))))) is different from true [2018-12-09 01:42:42,833 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |c_#valid|))) (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base))))) is different from true [2018-12-09 01:42:43,927 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 01:42:44,652 WARN L180 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-12-09 01:45:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:01,940 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2018-12-09 01:45:01,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 01:45:01,941 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-12-09 01:45:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:01,942 INFO L225 Difference]: With dead ends: 168 [2018-12-09 01:45:01,942 INFO L226 Difference]: Without dead ends: 168 [2018-12-09 01:45:01,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 108 SyntacticMatches, 14 SemanticMatches, 30 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=108, Invalid=442, Unknown=34, NotChecked=408, Total=992 [2018-12-09 01:45:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-09 01:45:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 129. [2018-12-09 01:45:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-09 01:45:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2018-12-09 01:45:01,945 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 57 [2018-12-09 01:45:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:01,946 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2018-12-09 01:45:01,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 01:45:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2018-12-09 01:45:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 01:45:01,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:01,947 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:01,947 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:45:01,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:01,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1786613403, now seen corresponding path program 1 times [2018-12-09 01:45:01,947 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:45:01,948 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:45:01,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:02,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:45:02,244 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 01:45:02,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:02,250 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 01:45:02,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:02,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:02,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:45:04,343 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)) (= |c_#length| (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32))))) is different from true [2018-12-09 01:45:05,747 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) |c_dll_create_#t~ret3.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32)) |c_dll_create_#t~ret3.base| (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-09 01:45:06,944 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32)) dll_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-09 01:45:06,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:06,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:06,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:06,984 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 18 treesize of output 13 [2018-12-09 01:45:06,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:07,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,005 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 01:45:07,008 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 01:45:07,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:07,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:07,029 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 01:45:07,029 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:25 [2018-12-09 01:45:07,865 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| (_ bv12 32)))) is different from true [2018-12-09 01:45:07,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,890 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 26 treesize of output 37 [2018-12-09 01:45:07,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 01:45:07,927 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 01:45:07,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:60 [2018-12-09 01:45:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 23 not checked. [2018-12-09 01:45:08,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:45:08,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:45:08,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:45:08,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:08,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:45:08,303 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 01:45:08,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:08,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, 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 01:45:08,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:08,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:08,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:45:09,554 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_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-09 01:45:10,227 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_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))))) is different from true [2018-12-09 01:45:11,889 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_9 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_9 (_ bv1 1)) |node_create_#t~malloc2.base|)) (= (select |c_old(#valid)| v_prenex_9) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| v_prenex_9 (_ bv12 32)) |node_create_#t~malloc2.base| (_ bv12 32))))) is different from true [2018-12-09 01:45:11,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:11,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:11,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 01:45:11,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:11,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-09 01:45:11,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:11,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:11,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:11,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:11,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:11,969 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 18 treesize of output 13 [2018-12-09 01:45:11,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:11,981 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 01:45:11,981 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-12-09 01:45:26,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:26,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:26,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:26,251 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 26 treesize of output 37 [2018-12-09 01:45:26,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 01:45:26,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-12-09 01:45:26,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:90 [2018-12-09 01:45:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 30 not checked. [2018-12-09 01:45:26,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:45:26,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:45:26,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 24 [2018-12-09 01:45:26,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 01:45:26,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 01:45:26,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=323, Unknown=14, NotChecked=294, Total=702 [2018-12-09 01:45:26,601 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 25 states. [2018-12-09 01:45:34,010 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-12-09 01:45:48,272 WARN L180 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 31 DAG size of output: 18 [2018-12-09 01:45:52,074 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_9 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_9 (_ bv1 1)) |node_create_#t~malloc2.base|)) (= (select |c_old(#valid)| v_prenex_9) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| v_prenex_9 (_ bv12 32)) |node_create_#t~malloc2.base| (_ bv12 32))))) (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32)) dll_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base))))) is different from true [2018-12-09 01:46:00,553 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 01:46:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:46:22,382 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2018-12-09 01:46:22,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 01:46:22,383 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-12-09 01:46:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:46:22,383 INFO L225 Difference]: With dead ends: 149 [2018-12-09 01:46:22,383 INFO L226 Difference]: Without dead ends: 149 [2018-12-09 01:46:22,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=123, Invalid=593, Unknown=18, NotChecked=456, Total=1190 [2018-12-09 01:46:22,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-09 01:46:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129. [2018-12-09 01:46:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-09 01:46:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2018-12-09 01:46:22,387 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 57 [2018-12-09 01:46:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:46:22,387 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2018-12-09 01:46:22,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 01:46:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2018-12-09 01:46:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 01:46:22,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:46:22,388 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:46:22,389 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:46:22,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:46:22,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1114162858, now seen corresponding path program 1 times [2018-12-09 01:46:22,389 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:46:22,389 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:46:22,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:46:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:46:22,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:46:22,627 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 01:46:22,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:22,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:22,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:46:24,649 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 01:46:26,662 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-09 01:46:28,433 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 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) is different from true [2018-12-09 01:46:30,436 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)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_create_~new_head~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 01:46:31,335 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 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_create_~head~0.base (_ bv1 1))))) is different from true [2018-12-09 01:46:33,338 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)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#res.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 01:46:33,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:33,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:33,344 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 01:46:33,354 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 01:46:33,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:33,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:33,369 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 01:46:33,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2018-12-09 01:46:36,498 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 01:46:36,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:36,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:36,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:36,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:36,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2018-12-09 01:46:36,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:36,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 45 treesize of output 46 [2018-12-09 01:46:36,611 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 22 treesize of output 25 [2018-12-09 01:46:36,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:36,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:46:36,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:36,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:36,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:36,636 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 27 treesize of output 39 [2018-12-09 01:46:36,636 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:36,651 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:36,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:36,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:36,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:46:36,708 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:65, output treesize:68 [2018-12-09 01:46:36,786 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 45 treesize of output 39 [2018-12-09 01:46:36,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:36,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:46:36,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:36,809 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 21 treesize of output 12 [2018-12-09 01:46:36,809 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:36,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:36,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:46:36,836 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:74, output treesize:41 [2018-12-09 01:46:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 2 refuted. 3 times theorem prover too weak. 1 trivial. 21 not checked. [2018-12-09 01:46:36,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:46:37,177 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 01:46:37,184 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 01:46:37,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:46:37,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-12-09 01:46:49,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:46:49,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:46:49,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:46:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:46:49,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:46:49,450 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 01:46:49,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:49,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:49,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:46:49,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:49,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:49,494 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 01:46:49,498 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 01:46:49,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:49,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:49,513 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 01:46:49,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-09 01:46:49,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:49,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:49,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:49,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:49,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2018-12-09 01:46:49,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:49,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 43 treesize of output 44 [2018-12-09 01:46:49,997 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 22 treesize of output 25 [2018-12-09 01:46:50,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:50,003 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:46:50,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:50,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:50,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:50,018 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 27 treesize of output 39 [2018-12-09 01:46:50,018 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:50,039 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:50,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:50,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:50,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:46:50,115 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:60, output treesize:63 [2018-12-09 01:46:50,213 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 43 treesize of output 37 [2018-12-09 01:46:50,218 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 01:46:50,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:50,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:50,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:46:50,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:50,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:50,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:46:50,269 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:72, output treesize:39 [2018-12-09 01:46:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 7 times theorem prover too weak. 1 trivial. 13 not checked. [2018-12-09 01:46:50,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:46:50,457 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 01:46:50,463 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 01:46:50,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:46:50,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-12-09 01:46:58,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:46:58,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 29 [2018-12-09 01:46:58,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 01:46:58,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 01:46:58,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=669, Unknown=14, NotChecked=342, Total=1122 [2018-12-09 01:46:58,889 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 30 states. [2018-12-09 01:47:16,007 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-12-09 01:47:20,221 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-12-09 01:47:25,063 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-09 01:47:26,182 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-12-09 01:47:26,449 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-12-09 01:47:30,917 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-12-09 01:47:31,155 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2018-12-09 01:48:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:48:07,904 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-12-09 01:48:07,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 01:48:07,904 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 61 [2018-12-09 01:48:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:48:07,905 INFO L225 Difference]: With dead ends: 167 [2018-12-09 01:48:07,905 INFO L226 Difference]: Without dead ends: 167 [2018-12-09 01:48:07,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=175, Invalid=1164, Unknown=17, NotChecked=450, Total=1806 [2018-12-09 01:48:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-09 01:48:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 130. [2018-12-09 01:48:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-09 01:48:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2018-12-09 01:48:07,908 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 61 [2018-12-09 01:48:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:48:07,908 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2018-12-09 01:48:07,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 01:48:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2018-12-09 01:48:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 01:48:07,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:48:07,909 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:48:07,909 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:48:07,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:48:07,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1114162859, now seen corresponding path program 1 times [2018-12-09 01:48:07,909 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:48:07,909 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:48:07,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:48:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:48:08,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:48:08,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:48:08,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:08,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:08,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:48:10,260 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 01:48:10,267 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 01:48:10,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:10,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:10,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-09 01:48:11,223 WARN L180 SmtUtils]: Spent 916.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-09 01:48:12,357 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 01:48:13,184 WARN L180 SmtUtils]: Spent 799.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-09 01:48:15,219 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 01:48:15,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:15,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:15,226 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 01:48:15,229 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 01:48:15,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:15,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:15,249 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 01:48:15,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:31 [2018-12-09 01:48:17,820 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32))) (.cse1 (bvadd node_create_~temp~0.offset (_ bv8 32)))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv12 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base))))) is different from true [2018-12-09 01:48:17,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:17,841 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 01:48:17,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:17,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:17,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:17,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-09 01:48:18,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 43 treesize of output 44 [2018-12-09 01:48:18,144 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 22 treesize of output 25 [2018-12-09 01:48:18,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:48:18,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,171 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 27 treesize of output 39 [2018-12-09 01:48:18,171 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,190 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 33 treesize of output 34 [2018-12-09 01:48:18,309 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 22 treesize of output 25 [2018-12-09 01:48:18,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,316 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:48:18,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,332 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 27 treesize of output 39 [2018-12-09 01:48:18,332 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,346 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,355 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,369 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:48:18,413 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:104, output treesize:73 [2018-12-09 01:48:18,532 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 33 treesize of output 29 [2018-12-09 01:48:18,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:48:18,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,552 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 01:48:18,553 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,593 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 43 treesize of output 37 [2018-12-09 01:48:18,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:18,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, 1 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 01:48:18,599 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,609 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 01:48:18,609 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,614 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:18,622 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 01:48:18,623 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:86, output treesize:20 [2018-12-09 01:48:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 25 not checked. [2018-12-09 01:48:18,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:48:19,879 WARN L180 SmtUtils]: Spent 712.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 01:48:20,062 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 01:48:20,158 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 01:48:20,195 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 01:48:22,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:22,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:23,358 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 01:48:23,400 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 01:48:23,911 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 01:48:23,949 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 01:48:24,358 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 01:48:24,385 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 01:48:24,593 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,612 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-12-09 01:48:24,758 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:220, output treesize:154 [2018-12-09 01:48:31,931 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 80 [2018-12-09 01:48:31,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:48:31,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:48:31,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:48:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:48:32,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:48:32,006 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 01:48:32,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:32,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:32,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:48:34,416 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-09 01:48:34,421 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 01:48:34,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:34,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:34,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-09 01:48:34,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:34,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:34,493 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 01:48:34,498 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 01:48:34,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:34,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:34,513 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 01:48:34,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-12-09 01:48:35,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-09 01:48:35,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 23 [2018-12-09 01:48:35,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 33 treesize of output 34 [2018-12-09 01:48:35,397 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 22 treesize of output 25 [2018-12-09 01:48:35,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:48:35,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,431 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 27 treesize of output 39 [2018-12-09 01:48:35,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,454 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 43 treesize of output 44 [2018-12-09 01:48:35,573 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 22 treesize of output 25 [2018-12-09 01:48:35,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,580 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:48:35,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,595 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 27 treesize of output 39 [2018-12-09 01:48:35,596 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,611 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,621 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,638 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:48:35,681 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:101, output treesize:70 [2018-12-09 01:48:35,859 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 33 treesize of output 29 [2018-12-09 01:48:35,863 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 01:48:35,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:48:35,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,922 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 43 treesize of output 37 [2018-12-09 01:48:35,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:35,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:48:35,928 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,940 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 01:48:35,940 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,945 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:35,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:48:35,955 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:86, output treesize:20 [2018-12-09 01:48:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2018-12-09 01:48:35,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:48:36,612 WARN L180 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 01:48:36,791 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 01:48:36,885 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 01:48:36,923 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 01:48:39,323 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 01:48:39,350 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 01:48:40,721 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 01:48:40,758 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 01:48:41,622 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:41,647 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:41,911 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 01:48:41,943 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 01:48:42,201 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:42,219 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:42,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-12-09 01:48:42,368 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:220, output treesize:154 [2018-12-09 01:48:47,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:48:47,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 33 [2018-12-09 01:48:47,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-09 01:48:47,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-09 01:48:47,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1103, Unknown=5, NotChecked=204, Total=1406 [2018-12-09 01:48:47,077 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand 34 states. [2018-12-09 01:48:59,590 WARN L180 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-12-09 01:49:04,172 WARN L180 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2018-12-09 01:49:07,030 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2018-12-09 01:49:12,686 WARN L180 SmtUtils]: Spent 3.18 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-09 01:49:15,809 WARN L180 SmtUtils]: Spent 2.76 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-09 01:49:22,015 WARN L180 SmtUtils]: Spent 6.00 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-09 01:49:22,687 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 01:49:24,211 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-12-09 01:49:25,147 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-12-09 01:49:32,079 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-12-09 01:49:32,353 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2018-12-09 01:49:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:49:37,357 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2018-12-09 01:49:37,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 01:49:37,358 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 61 [2018-12-09 01:49:37,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:49:37,359 INFO L225 Difference]: With dead ends: 156 [2018-12-09 01:49:37,359 INFO L226 Difference]: Without dead ends: 156 [2018-12-09 01:49:37,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 58.0s TimeCoverageRelationStatistics Valid=213, Invalid=2443, Unknown=8, NotChecked=306, Total=2970 [2018-12-09 01:49:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-09 01:49:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 133. [2018-12-09 01:49:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 01:49:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2018-12-09 01:49:37,362 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 61 [2018-12-09 01:49:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:49:37,363 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2018-12-09 01:49:37,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-09 01:49:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-12-09 01:49:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 01:49:37,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:49:37,363 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:49:37,364 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:49:37,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:49:37,364 INFO L82 PathProgramCache]: Analyzing trace with hash 174573841, now seen corresponding path program 1 times [2018-12-09 01:49:37,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:49:37,364 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:49:37,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:49:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:49:37,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:49:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 01:49:37,575 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:49:37,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:49:37,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:49:37,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:49:37,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:49:37,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:49:37,578 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 6 states. [2018-12-09 01:49:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:49:37,946 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2018-12-09 01:49:37,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:49:37,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 01:49:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:49:37,947 INFO L225 Difference]: With dead ends: 131 [2018-12-09 01:49:37,947 INFO L226 Difference]: Without dead ends: 131 [2018-12-09 01:49:37,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 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 01:49:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-09 01:49:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-09 01:49:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-09 01:49:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2018-12-09 01:49:37,950 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 62 [2018-12-09 01:49:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:49:37,950 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2018-12-09 01:49:37,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:49:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2018-12-09 01:49:37,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 01:49:37,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:49:37,950 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:49:37,950 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:49:37,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:49:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash 518465331, now seen corresponding path program 1 times [2018-12-09 01:49:37,951 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:49:37,951 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:49:37,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:49:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:49:38,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:49:38,118 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 01:49:38,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:38,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:38,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:49:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 01:49:38,136 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:49:38,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:49:38,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:49:38,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:49:38,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:49:38,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:49:38,139 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 6 states. [2018-12-09 01:49:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:49:38,466 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2018-12-09 01:49:38,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:49:38,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 01:49:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:49:38,467 INFO L225 Difference]: With dead ends: 130 [2018-12-09 01:49:38,467 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 01:49:38,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 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 01:49:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 01:49:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-09 01:49:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-09 01:49:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-12-09 01:49:38,471 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 64 [2018-12-09 01:49:38,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:49:38,471 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-12-09 01:49:38,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:49:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-12-09 01:49:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 01:49:38,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:49:38,472 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:49:38,472 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:49:38,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:49:38,472 INFO L82 PathProgramCache]: Analyzing trace with hash 518465332, now seen corresponding path program 1 times [2018-12-09 01:49:38,473 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:49:38,473 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:49:38,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:49:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:49:38,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:49:38,662 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 01:49:38,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:38,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:38,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:49:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 01:49:38,709 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:49:38,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:49:38,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:49:38,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:49:38,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:49:38,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:49:38,712 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 6 states. [2018-12-09 01:49:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:49:39,081 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2018-12-09 01:49:39,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:49:39,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 01:49:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:49:39,082 INFO L225 Difference]: With dead ends: 129 [2018-12-09 01:49:39,082 INFO L226 Difference]: Without dead ends: 129 [2018-12-09 01:49:39,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 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 01:49:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-09 01:49:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-09 01:49:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-09 01:49:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2018-12-09 01:49:39,084 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 64 [2018-12-09 01:49:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:49:39,084 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2018-12-09 01:49:39,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:49:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2018-12-09 01:49:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 01:49:39,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:49:39,085 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:49:39,085 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:49:39,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:49:39,085 INFO L82 PathProgramCache]: Analyzing trace with hash -476056231, now seen corresponding path program 1 times [2018-12-09 01:49:39,085 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:49:39,085 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:49:39,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:49:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:49:39,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:49:39,260 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 01:49:39,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:39,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:39,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:49:39,307 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 01:49:39,309 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 01:49:39,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:39,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:39,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:39,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2018-12-09 01:49:39,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 01:49:39,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 01:49:39,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:39,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:39,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:39,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-09 01:49:39,372 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 01:49:39,372 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:49:39,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:49:39,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 01:49:39,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:49:39,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:49:39,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:49:39,375 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 12 states. [2018-12-09 01:49:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:49:40,170 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2018-12-09 01:49:40,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:49:40,170 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-12-09 01:49:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:49:40,171 INFO L225 Difference]: With dead ends: 153 [2018-12-09 01:49:40,171 INFO L226 Difference]: Without dead ends: 153 [2018-12-09 01:49:40,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:49:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-09 01:49:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2018-12-09 01:49:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-09 01:49:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2018-12-09 01:49:40,174 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 65 [2018-12-09 01:49:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:49:40,174 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2018-12-09 01:49:40,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:49:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2018-12-09 01:49:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 01:49:40,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:49:40,175 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:49:40,175 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:49:40,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:49:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash -476056230, now seen corresponding path program 1 times [2018-12-09 01:49:40,175 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:49:40,175 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/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 01:49:40,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:49:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:49:40,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:49:40,385 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 01:49:40,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:49:40,452 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 01:49:40,454 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 01:49:40,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,470 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 01:49:40,472 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 01:49:40,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-09 01:49:40,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 01:49:40,521 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 01:49:40,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 01:49:40,533 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 01:49:40,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:40,539 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-09 01:49:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 01:49:40,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:49:40,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:49:40,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 01:49:40,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:49:40,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:49:40,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:49:40,581 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand 12 states. [2018-12-09 01:49:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:49:41,540 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2018-12-09 01:49:41,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:49:41,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-12-09 01:49:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:49:41,541 INFO L225 Difference]: With dead ends: 159 [2018-12-09 01:49:41,541 INFO L226 Difference]: Without dead ends: 159 [2018-12-09 01:49:41,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-09 01:49:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-09 01:49:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2018-12-09 01:49:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-09 01:49:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2018-12-09 01:49:41,544 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 65 [2018-12-09 01:49:41,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:49:41,544 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2018-12-09 01:49:41,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:49:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2018-12-09 01:49:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 01:49:41,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:49:41,545 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:49:41,545 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:49:41,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:49:41,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1107391264, now seen corresponding path program 1 times [2018-12-09 01:49:41,546 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:49:41,546 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:49:41,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:49:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:49:41,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:49:41,890 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 01:49:41,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:41,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:41,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:49:42,100 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 13 treesize of output 10 [2018-12-09 01:49:42,102 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 10 treesize of output 9 [2018-12-09 01:49:42,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:42,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:42,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:42,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-12-09 01:49:42,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:42,195 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 83 [2018-12-09 01:49:42,199 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 16 treesize of output 15 [2018-12-09 01:49:42,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:42,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:42,236 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 01:49:42,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:59 [2018-12-09 01:49:42,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:42,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:42,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:42,587 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 52 [2018-12-09 01:49:42,591 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 32 treesize of output 46 [2018-12-09 01:49:42,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:42,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:42,629 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 01:49:42,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:60 [2018-12-09 01:49:45,708 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32))) (.cse1 (bvadd node_create_~temp~0.offset (_ bv8 32)))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-09 01:49:45,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:45,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:45,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:45,755 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:49:45,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 127 [2018-12-09 01:49:45,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:45,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-09 01:49:45,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-09 01:49:45,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:45,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:49:45,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:45,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:46,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:46,011 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 27 treesize of output 39 [2018-12-09 01:49:46,011 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:46,036 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:46,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:46,075 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:46,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 120 [2018-12-09 01:49:46,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-09 01:49:46,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:46,238 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:49:46,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:46,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:46,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:46,257 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 27 treesize of output 39 [2018-12-09 01:49:46,257 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:46,277 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:46,290 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:46,330 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:46,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:49:46,401 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:161, output treesize:165 [2018-12-09 01:49:46,600 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 33 treesize of output 29 [2018-12-09 01:49:46,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:46,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:49:46,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:46,626 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 01:49:46,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:46,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:46,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 01:49:46,711 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:178, output treesize:149 [2018-12-09 01:49:47,026 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 0 case distinctions, treesize of input 133 treesize of output 88 [2018-12-09 01:49:47,033 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 9 treesize of output 1 [2018-12-09 01:49:47,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:47,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:47,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:49:47,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:47,109 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 30 treesize of output 22 [2018-12-09 01:49:47,110 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 01:49:47,127 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 33 treesize of output 20 [2018-12-09 01:49:47,127 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:47,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:49:47,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:49:47,161 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:150, output treesize:52 [2018-12-09 01:49:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-09 01:49:47,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:49:48,511 WARN L180 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 01:49:48,671 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 01:49:48,757 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 01:49:48,766 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 01:49:48,809 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 01:49:48,823 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 01:49:48,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 01:49:48,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:85 [2018-12-09 01:49:50,872 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_node_create_~temp~0.offset_89 (_ BitVec 32)) (v_DerPreprocessor_32 (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (|v_node_create_#t~malloc2.base_87| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_node_create_#t~malloc2.base_87|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_node_create_#t~malloc2.base_87| (_ bv1 1)) (let ((.cse1 (bvadd v_node_create_~temp~0.offset_89 (_ bv4 32))) (.cse2 (bvadd v_node_create_~temp~0.offset_89 (_ bv8 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_#t~malloc2.base_87| (store (store (store (select |c_#memory_$Pointer$.base| |v_node_create_#t~malloc2.base_87|) .cse1 (_ bv0 32)) .cse2 (_ bv0 32)) v_node_create_~temp~0.offset_89 v_DerPreprocessor_30)))) (select .cse0 (select (select .cse0 c_dll_append_~head.base) c_dll_append_~head.offset))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_#t~malloc2.base_87| (store (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_#t~malloc2.base_87|) .cse1 (_ bv0 32)) .cse2 (_ bv0 32)) v_node_create_~temp~0.offset_89 v_DerPreprocessor_32)) c_dll_append_~head.base) c_dll_append_~head.offset) (_ bv4 32))))) (_ bv1 1)) (_ bv0 1)))) is different from false [2018-12-09 01:49:50,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:49:50,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:49:50,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:49:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:49:50,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:49:50,963 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 01:49:50,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:50,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:50,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:49:51,854 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 13 treesize of output 10 [2018-12-09 01:49:51,856 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 10 treesize of output 9 [2018-12-09 01:49:51,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:51,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:51,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:51,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:30 [2018-12-09 01:49:52,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:52,041 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 68 treesize of output 72 [2018-12-09 01:49:52,044 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 16 treesize of output 15 [2018-12-09 01:49:52,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:52,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:52,073 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 01:49:52,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:48 [2018-12-09 01:49:52,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:52,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:52,717 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-12-09 01:49:52,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-12-09 01:49:52,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:52,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:52,765 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 01:49:52,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:54 [2018-12-09 01:49:53,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:53,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:53,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:53,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:53,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 91 [2018-12-09 01:49:53,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:53,884 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-12-09 01:49:53,888 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 110 [2018-12-09 01:49:53,895 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 22 treesize of output 25 [2018-12-09 01:49:53,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:53,912 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:49:53,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:53,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:53,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:53,940 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 27 treesize of output 39 [2018-12-09 01:49:53,940 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:53,968 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:53,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:54,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:54,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-09 01:49:54,151 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 22 treesize of output 25 [2018-12-09 01:49:54,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:54,161 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:49:54,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:54,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:54,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:54,184 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 27 treesize of output 39 [2018-12-09 01:49:54,185 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:54,205 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:54,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:54,237 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:54,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:49:54,308 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:145, output treesize:149 [2018-12-09 01:49:54,612 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 33 treesize of output 29 [2018-12-09 01:49:54,617 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 01:49:54,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:54,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:54,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:49:54,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:54,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:49:54,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-09 01:49:54,733 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:163, output treesize:134 [2018-12-09 01:49:57,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 86 [2018-12-09 01:49:57,036 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 77 treesize of output 76 [2018-12-09 01:49:57,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:57,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2018-12-09 01:49:57,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:57,236 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 61 treesize of output 45 [2018-12-09 01:49:57,236 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 01:49:57,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:57,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-12-09 01:49:57,327 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:57,413 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 55 treesize of output 41 [2018-12-09 01:49:57,414 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 01:49:57,475 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 38 treesize of output 27 [2018-12-09 01:49:57,476 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:57,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:49:57,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-09 01:49:57,531 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:49:57,559 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 01:49:57,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-09 01:49:57,595 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:135, output treesize:95 [2018-12-09 01:49:58,136 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 31 [2018-12-09 01:49:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-09 01:49:58,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:49:59,404 WARN L180 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 01:49:59,568 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 01:49:59,653 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 01:49:59,668 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 01:49:59,725 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 01:49:59,754 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 01:49:59,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 01:49:59,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:111 [2018-12-09 01:50:29,287 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-09 01:50:29,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:50:29,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 51 [2018-12-09 01:50:29,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-09 01:50:29,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-09 01:50:29,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3340, Unknown=11, NotChecked=234, Total=3782 [2018-12-09 01:50:29,304 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand 52 states. [2018-12-09 01:50:44,725 WARN L180 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-09 01:50:49,495 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-12-09 01:50:52,813 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2018-12-09 01:50:54,730 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-12-09 01:50:56,542 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-12-09 01:50:57,935 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-09 01:50:58,587 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-09 01:51:00,365 WARN L180 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2018-12-09 01:51:01,292 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2018-12-09 01:51:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:51:04,009 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2018-12-09 01:51:04,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 01:51:04,010 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 65 [2018-12-09 01:51:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:51:04,011 INFO L225 Difference]: With dead ends: 159 [2018-12-09 01:51:04,011 INFO L226 Difference]: Without dead ends: 159 [2018-12-09 01:51:04,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=362, Invalid=5330, Unknown=16, NotChecked=298, Total=6006 [2018-12-09 01:51:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-09 01:51:04,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 141. [2018-12-09 01:51:04,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 01:51:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2018-12-09 01:51:04,014 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 65 [2018-12-09 01:51:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:51:04,014 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2018-12-09 01:51:04,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-09 01:51:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2018-12-09 01:51:04,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 01:51:04,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:51:04,015 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:51:04,015 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 01:51:04,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:51:04,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1107391263, now seen corresponding path program 1 times [2018-12-09 01:51:04,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:51:04,015 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:51:04,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:51:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:51:04,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:51:04,428 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 01:51:04,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:51:04,442 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 01:51:04,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-09 01:51:04,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:04,608 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 14 treesize of output 17 [2018-12-09 01:51:04,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:41 [2018-12-09 01:51:04,740 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 13 treesize of output 10 [2018-12-09 01:51:04,743 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 10 treesize of output 9 [2018-12-09 01:51:04,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,778 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 13 treesize of output 10 [2018-12-09 01:51:04,780 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 10 treesize of output 9 [2018-12-09 01:51:04,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,805 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2018-12-09 01:51:04,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:04,904 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 33 treesize of output 34 [2018-12-09 01:51:04,908 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 14 treesize of output 13 [2018-12-09 01:51:04,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:04,966 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 90 treesize of output 94 [2018-12-09 01:51:04,969 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 14 treesize of output 13 [2018-12-09 01:51:04,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:04,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:05,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:05,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:130, output treesize:97 [2018-12-09 01:51:05,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:05,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:05,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:05,452 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-12-09 01:51:05,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 52 [2018-12-09 01:51:05,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:05,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:05,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:05,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:105, output treesize:106 [2018-12-09 01:51:08,732 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32))) (.cse1 (bvadd node_create_~temp~0.offset (_ bv8 32)))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv12 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base))))) is different from true [2018-12-09 01:51:08,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:08,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:08,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 84 [2018-12-09 01:51:08,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:08,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:08,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:09,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:09,003 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:51:09,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 79 [2018-12-09 01:51:09,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:09,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 184 [2018-12-09 01:51:09,309 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 22 treesize of output 25 [2018-12-09 01:51:09,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:09,319 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:51:09,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:09,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:09,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:09,344 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 27 treesize of output 39 [2018-12-09 01:51:09,344 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:09,370 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:09,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:09,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:09,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 197 [2018-12-09 01:51:09,636 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 22 treesize of output 25 [2018-12-09 01:51:09,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:09,647 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:51:09,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:09,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:09,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:09,665 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 27 treesize of output 39 [2018-12-09 01:51:09,665 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:09,683 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:09,694 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:09,743 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:09,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:51:09,822 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:253, output treesize:227 [2018-12-09 01:51:10,483 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 0 case distinctions, treesize of input 206 treesize of output 174 [2018-12-09 01:51:10,491 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 7 treesize of output 1 [2018-12-09 01:51:10,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:10,550 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 19 treesize of output 3 [2018-12-09 01:51:10,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:10,589 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 115 treesize of output 86 [2018-12-09 01:51:10,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:10,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:10,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:51:10,632 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:10,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:10,750 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 0 case distinctions, treesize of input 131 treesize of output 86 [2018-12-09 01:51:10,757 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 7 treesize of output 1 [2018-12-09 01:51:10,757 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:10,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:10,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:51:10,814 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:10,838 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 30 treesize of output 22 [2018-12-09 01:51:10,838 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 01:51:10,859 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 33 treesize of output 20 [2018-12-09 01:51:10,859 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:10,874 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:51:10,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:51:10,898 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:262, output treesize:37 [2018-12-09 01:51:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-09 01:51:11,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:51:13,018 WARN L180 SmtUtils]: Spent 647.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 01:51:13,219 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 01:51:13,318 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 01:51:13,371 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 01:51:14,990 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 01:51:15,056 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 01:51:17,145 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 01:51:17,182 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 01:51:18,226 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 01:51:18,258 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 01:51:18,740 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 01:51:18,781 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 01:51:19,183 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 01:51:19,209 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 01:51:19,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-12-09 01:51:19,804 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:270, output treesize:384 [2018-12-09 01:51:36,413 WARN L180 SmtUtils]: Spent 3.49 s on a formula simplification that was a NOOP. DAG size: 107 [2018-12-09 01:51:36,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:51:36,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fd7fe21-430b-4c58-bc2d-ca90e453e402/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:51:36,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:51:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:51:36,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:51:36,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:51:36,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:36,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:36,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:51:36,614 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 01:51:36,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:36,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:36,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-09 01:51:37,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:37,526 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 01:51:37,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:37,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:37,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2018-12-09 01:51:38,162 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 13 treesize of output 10 [2018-12-09 01:51:38,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:51:38,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:38,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:38,203 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 13 treesize of output 10 [2018-12-09 01:51:38,206 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 10 treesize of output 9 [2018-12-09 01:51:38,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:38,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:38,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:38,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:54 [2018-12-09 01:51:38,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:38,498 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 111 treesize of output 115 [2018-12-09 01:51:38,501 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 14 treesize of output 13 [2018-12-09 01:51:38,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:38,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:38,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:38,563 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 33 treesize of output 34 [2018-12-09 01:51:38,566 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 14 treesize of output 13 [2018-12-09 01:51:38,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:38,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:38,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:38,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:86 [2018-12-09 01:51:39,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:39,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:39,524 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2018-12-09 01:51:39,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-12-09 01:51:39,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:39,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:39,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:39,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:91, output treesize:90 [2018-12-09 01:51:42,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:42,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:42,650 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 29 treesize of output 64 [2018-12-09 01:51:42,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:42,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:42,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:42,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:42,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:42,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 49 [2018-12-09 01:51:42,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:43,183 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-12-09 01:51:43,186 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 104 [2018-12-09 01:51:43,195 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 22 treesize of output 25 [2018-12-09 01:51:43,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:43,207 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:51:43,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:43,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:43,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:43,231 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 27 treesize of output 39 [2018-12-09 01:51:43,231 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:43,260 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:43,276 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:43,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:43,476 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 128 [2018-12-09 01:51:43,483 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 22 treesize of output 25 [2018-12-09 01:51:43,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:43,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 01:51:43,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:43,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:43,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:43,511 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 27 treesize of output 39 [2018-12-09 01:51:43,511 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:43,528 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:43,541 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:43,585 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:43,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:51:43,650 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:187, output treesize:164 [2018-12-09 01:51:45,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 118 [2018-12-09 01:51:45,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:45,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-12-09 01:51:45,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:45,134 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:51:45,135 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 40 treesize of output 36 [2018-12-09 01:51:45,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:45,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:45,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-12-09 01:51:45,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:45,256 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:51:45,256 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 47 treesize of output 43 [2018-12-09 01:51:45,257 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:45,309 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 31 treesize of output 15 [2018-12-09 01:51:45,309 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:45,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:51:45,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 84 [2018-12-09 01:51:45,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:45,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2018-12-09 01:51:45,452 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:45,552 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 57 treesize of output 50 [2018-12-09 01:51:45,552 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:45,637 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 01:51:45,637 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:45,713 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 39 treesize of output 31 [2018-12-09 01:51:45,713 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 01:51:45,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:51:45,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-12-09 01:51:45,793 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:45,849 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 53 treesize of output 42 [2018-12-09 01:51:45,849 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 01:51:45,894 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 42 treesize of output 30 [2018-12-09 01:51:45,895 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 01:51:45,932 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 01:51:45,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 01:51:45,993 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:200, output treesize:67 [2018-12-09 01:51:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-09 01:51:46,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:51:49,893 WARN L180 SmtUtils]: Spent 800.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 01:51:50,075 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 01:51:50,173 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 01:51:50,235 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 01:51:53,295 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 01:51:53,348 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 01:51:55,387 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 01:51:55,460 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 01:51:56,558 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 01:51:56,604 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 01:51:57,345 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 01:51:57,398 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 01:51:58,749 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 01:51:58,813 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 01:51:59,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-12-09 01:51:59,246 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:300, output treesize:468 [2018-12-09 01:52:05,684 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 01:52:05,885 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:52:05,886 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:893) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-09 01:52:05,892 INFO L168 Benchmark]: Toolchain (without parser) took 649560.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 938.0 MB in the beginning and 860.7 MB in the end (delta: 77.4 MB). Peak memory consumption was 256.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:52:05,893 INFO L168 Benchmark]: CDTParser took 0.11 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 01:52:05,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:52:05,893 INFO L168 Benchmark]: Boogie Preprocessor took 35.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:52:05,894 INFO L168 Benchmark]: RCFGBuilder took 430.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:52:05,894 INFO L168 Benchmark]: TraceAbstraction took 648801.70 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.0 GB in the beginning and 860.7 MB in the end (delta: 166.4 MB). Peak memory consumption was 228.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:52:05,895 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.11 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 289.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 430.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 648801.70 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.0 GB in the beginning and 860.7 MB in the end (delta: 166.4 MB). Peak memory consumption was 228.8 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...