./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.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_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba5476636e8902440a35b69190524704fd5af5c4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba5476636e8902440a35b69190524704fd5af5c4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:23:51,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:23:51,146 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:23:51,153 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:23:51,154 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:23:51,154 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:23:51,155 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:23:51,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:23:51,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:23:51,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:23:51,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:23:51,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:23:51,159 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:23:51,160 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:23:51,161 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:23:51,161 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:23:51,162 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:23:51,163 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:23:51,165 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:23:51,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:23:51,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:23:51,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:23:51,169 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:23:51,169 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:23:51,169 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:23:51,170 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:23:51,171 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:23:51,171 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:23:51,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:23:51,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:23:51,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:23:51,173 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:23:51,173 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:23:51,174 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:23:51,174 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:23:51,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:23:51,175 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 15:23:51,184 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:23:51,184 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:23:51,185 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:23:51,185 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:23:51,185 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 15:23:51,185 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 15:23:51,185 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 15:23:51,185 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 15:23:51,185 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 15:23:51,185 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 15:23:51,185 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 15:23:51,185 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 15:23:51,186 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 15:23:51,186 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:23:51,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:23:51,186 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:23:51,186 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:23:51,186 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 15:23:51,186 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:23:51,186 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:23:51,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:23:51,186 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 15:23:51,187 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 15:23:51,187 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 15:23:51,187 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:23:51,187 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:23:51,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:23:51,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:23:51,187 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:23:51,187 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:23:51,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:23:51,187 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:23:51,187 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:23:51,187 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 15:23:51,188 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:23:51,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:23:51,188 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba5476636e8902440a35b69190524704fd5af5c4 [2018-12-09 15:23:51,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:23:51,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:23:51,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:23:51,217 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:23:51,217 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:23:51,217 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-09 15:23:51,256 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/data/274b291ae/2f565f0785b44b6f91f5b36b02d94e46/FLAGfbec2c42c [2018-12-09 15:23:51,711 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:23:51,711 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-09 15:23:51,722 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/data/274b291ae/2f565f0785b44b6f91f5b36b02d94e46/FLAGfbec2c42c [2018-12-09 15:23:51,733 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/data/274b291ae/2f565f0785b44b6f91f5b36b02d94e46 [2018-12-09 15:23:51,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:23:51,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:23:51,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:23:51,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:23:51,740 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:23:51,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:23:51" (1/1) ... [2018-12-09 15:23:51,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461c4b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:51, skipping insertion in model container [2018-12-09 15:23:51,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:23:51" (1/1) ... [2018-12-09 15:23:51,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:23:51,774 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:23:52,013 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:23:52,024 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:23:52,058 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:23:52,090 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:23:52,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52 WrapperNode [2018-12-09 15:23:52,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:23:52,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:23:52,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:23:52,091 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:23:52,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52" (1/1) ... [2018-12-09 15:23:52,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52" (1/1) ... [2018-12-09 15:23:52,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:23:52,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:23:52,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:23:52,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:23:52,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52" (1/1) ... [2018-12-09 15:23:52,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52" (1/1) ... [2018-12-09 15:23:52,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52" (1/1) ... [2018-12-09 15:23:52,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52" (1/1) ... [2018-12-09 15:23:52,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52" (1/1) ... [2018-12-09 15:23:52,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52" (1/1) ... [2018-12-09 15:23:52,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52" (1/1) ... [2018-12-09 15:23:52,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:23:52,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:23:52,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:23:52,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:23:52,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:23:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:23:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-09 15:23:52,161 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-09 15:23:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-12-09 15:23:52,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-12-09 15:23:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 15:23:52,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 15:23:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-12-09 15:23:52,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-12-09 15:23:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2018-12-09 15:23:52,162 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2018-12-09 15:23:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:23:52,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:23:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:23:52,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:23:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 15:23:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 15:23:52,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 15:23:52,163 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 15:23:52,163 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 15:23:52,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:23:52,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:23:52,319 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:23:52,320 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 15:23:52,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:23:52 BoogieIcfgContainer [2018-12-09 15:23:52,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:23:52,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:23:52,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:23:52,322 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:23:52,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:23:51" (1/3) ... [2018-12-09 15:23:52,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb5157b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:23:52, skipping insertion in model container [2018-12-09 15:23:52,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:52" (2/3) ... [2018-12-09 15:23:52,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb5157b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:23:52, skipping insertion in model container [2018-12-09 15:23:52,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:23:52" (3/3) ... [2018-12-09 15:23:52,324 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-09 15:23:52,330 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:23:52,335 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 15:23:52,346 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 15:23:52,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:23:52,361 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 15:23:52,361 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:23:52,361 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:23:52,361 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:23:52,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:23:52,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:23:52,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:23:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-12-09 15:23:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 15:23:52,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:52,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:52,378 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:52,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1206133031, now seen corresponding path program 1 times [2018-12-09 15:23:52,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:52,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:52,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:52,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:52,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:52,559 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 15:23:52,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:52,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:23:52,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:52,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:23:52,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:23:52,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:23:52,574 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 7 states. [2018-12-09 15:23:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:52,738 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-12-09 15:23:52,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:23:52,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-09 15:23:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:52,748 INFO L225 Difference]: With dead ends: 67 [2018-12-09 15:23:52,748 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 15:23:52,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:23:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 15:23:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-09 15:23:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 15:23:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-12-09 15:23:52,777 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2018-12-09 15:23:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:52,777 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-12-09 15:23:52,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:23:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-12-09 15:23:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 15:23:52,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:52,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:52,778 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:52,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:52,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1206133030, now seen corresponding path program 1 times [2018-12-09 15:23:52,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:52,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:52,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:52,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:52,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:52,872 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 15:23:52,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:52,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:23:52,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:52,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:23:52,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:23:52,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:23:52,874 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 8 states. [2018-12-09 15:23:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:53,049 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-09 15:23:53,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:23:53,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-09 15:23:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:53,050 INFO L225 Difference]: With dead ends: 60 [2018-12-09 15:23:53,050 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 15:23:53,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:23:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 15:23:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-09 15:23:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 15:23:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-09 15:23:53,054 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 17 [2018-12-09 15:23:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:53,055 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-09 15:23:53,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:23:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-09 15:23:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:23:53,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:53,055 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 15:23:53,056 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:53,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:53,056 INFO L82 PathProgramCache]: Analyzing trace with hash -212703262, now seen corresponding path program 1 times [2018-12-09 15:23:53,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:53,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:53,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:53,123 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 15:23:53,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:53,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:23:53,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:53,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:23:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:23:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:23:53,125 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 8 states. [2018-12-09 15:23:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:53,245 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-12-09 15:23:53,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:23:53,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-12-09 15:23:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:53,246 INFO L225 Difference]: With dead ends: 78 [2018-12-09 15:23:53,246 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 15:23:53,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-09 15:23:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 15:23:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2018-12-09 15:23:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 15:23:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-12-09 15:23:53,250 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 20 [2018-12-09 15:23:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:53,251 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-12-09 15:23:53,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:23:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-12-09 15:23:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:23:53,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:53,251 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 15:23:53,251 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:53,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:53,252 INFO L82 PathProgramCache]: Analyzing trace with hash -212703261, now seen corresponding path program 1 times [2018-12-09 15:23:53,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:53,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:53,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:53,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:53,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:53,431 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 15:23:53,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:53,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 15:23:53,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:53,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 15:23:53,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 15:23:53,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:23:53,432 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 11 states. [2018-12-09 15:23:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:53,832 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-09 15:23:53,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 15:23:53,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-09 15:23:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:53,834 INFO L225 Difference]: With dead ends: 71 [2018-12-09 15:23:53,835 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 15:23:53,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-09 15:23:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 15:23:53,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2018-12-09 15:23:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 15:23:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-12-09 15:23:53,840 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 20 [2018-12-09 15:23:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:53,840 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-12-09 15:23:53,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 15:23:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-12-09 15:23:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 15:23:53,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:53,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:53,841 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:53,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash 594701227, now seen corresponding path program 1 times [2018-12-09 15:23:53,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:53,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:53,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:53,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:53,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:53,860 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 15:23:53,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:53,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:23:53,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:53,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:23:53,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:23:53,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:23:53,861 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-12-09 15:23:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:53,866 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-12-09 15:23:53,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:23:53,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-09 15:23:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:53,867 INFO L225 Difference]: With dead ends: 58 [2018-12-09 15:23:53,867 INFO L226 Difference]: Without dead ends: 58 [2018-12-09 15:23:53,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:23:53,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-09 15:23:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-09 15:23:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 15:23:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-09 15:23:53,870 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 19 [2018-12-09 15:23:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:53,870 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-09 15:23:53,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:23:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-09 15:23:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 15:23:53,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:53,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:53,871 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:53,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:53,871 INFO L82 PathProgramCache]: Analyzing trace with hash 398187722, now seen corresponding path program 1 times [2018-12-09 15:23:53,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:53,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:53,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:53,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:53,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:53,894 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 15:23:53,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:53,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:23:53,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:53,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:23:53,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:23:53,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:23:53,896 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2018-12-09 15:23:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:53,995 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-09 15:23:53,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:23:53,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-09 15:23:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:53,996 INFO L225 Difference]: With dead ends: 56 [2018-12-09 15:23:53,996 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 15:23:53,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:23:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 15:23:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-09 15:23:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 15:23:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-09 15:23:53,999 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 19 [2018-12-09 15:23:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:53,999 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-09 15:23:53,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:23:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-09 15:23:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 15:23:53,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:53,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:54,000 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:54,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash 398187723, now seen corresponding path program 1 times [2018-12-09 15:23:54,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:54,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:54,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:54,036 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 15:23:54,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:54,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:23:54,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:54,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:23:54,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:23:54,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:23:54,037 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2018-12-09 15:23:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:54,160 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-09 15:23:54,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:23:54,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-09 15:23:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:54,161 INFO L225 Difference]: With dead ends: 80 [2018-12-09 15:23:54,161 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 15:23:54,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:23:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 15:23:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2018-12-09 15:23:54,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 15:23:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-12-09 15:23:54,163 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-12-09 15:23:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:54,163 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-12-09 15:23:54,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:23:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-12-09 15:23:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 15:23:54,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:54,164 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] [2018-12-09 15:23:54,164 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:54,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:54,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1996133472, now seen corresponding path program 1 times [2018-12-09 15:23:54,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:54,200 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 15:23:54,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:54,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 15:23:54,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:54,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:23:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:23:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:23:54,201 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 9 states. [2018-12-09 15:23:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:54,294 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2018-12-09 15:23:54,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:23:54,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-09 15:23:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:54,295 INFO L225 Difference]: With dead ends: 64 [2018-12-09 15:23:54,295 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 15:23:54,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:23:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 15:23:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-12-09 15:23:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 15:23:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-09 15:23:54,297 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 21 [2018-12-09 15:23:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:54,297 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-09 15:23:54,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:23:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-09 15:23:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 15:23:54,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:54,298 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] [2018-12-09 15:23:54,298 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:54,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1996133473, now seen corresponding path program 1 times [2018-12-09 15:23:54,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:54,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:54,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:54,378 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 15:23:54,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:54,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:23:54,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:54,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:23:54,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:23:54,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:23:54,379 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 10 states. [2018-12-09 15:23:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:54,513 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2018-12-09 15:23:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:23:54,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-09 15:23:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:54,514 INFO L225 Difference]: With dead ends: 62 [2018-12-09 15:23:54,514 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 15:23:54,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-09 15:23:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 15:23:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-12-09 15:23:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 15:23:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-09 15:23:54,517 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 21 [2018-12-09 15:23:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:54,518 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-09 15:23:54,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:23:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-09 15:23:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 15:23:54,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:54,519 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] [2018-12-09 15:23:54,519 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:54,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:54,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2125216191, now seen corresponding path program 1 times [2018-12-09 15:23:54,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:54,542 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 15:23:54,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:54,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:23:54,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:54,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:23:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:23:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:23:54,543 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 5 states. [2018-12-09 15:23:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:54,548 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-12-09 15:23:54,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:23:54,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-09 15:23:54,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:54,549 INFO L225 Difference]: With dead ends: 48 [2018-12-09 15:23:54,549 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 15:23:54,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:23:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 15:23:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 15:23:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 15:23:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2018-12-09 15:23:54,551 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 21 [2018-12-09 15:23:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:54,551 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2018-12-09 15:23:54,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:23:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2018-12-09 15:23:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 15:23:54,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:54,552 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 15:23:54,552 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:54,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1566114557, now seen corresponding path program 1 times [2018-12-09 15:23:54,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:54,575 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 15:23:54,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:54,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:23:54,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:54,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:23:54,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:23:54,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:23:54,576 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 5 states. [2018-12-09 15:23:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:54,613 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-12-09 15:23:54,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:23:54,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 15:23:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:54,614 INFO L225 Difference]: With dead ends: 43 [2018-12-09 15:23:54,614 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 15:23:54,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 15:23:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 15:23:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 15:23:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 15:23:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2018-12-09 15:23:54,616 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 23 [2018-12-09 15:23:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:54,617 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2018-12-09 15:23:54,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:23:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2018-12-09 15:23:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 15:23:54,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:54,617 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 15:23:54,617 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:54,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1566114556, now seen corresponding path program 1 times [2018-12-09 15:23:54,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:54,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:54,720 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 15:23:54,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:54,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:23:54,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:54,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:23:54,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:23:54,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:23:54,721 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 10 states. [2018-12-09 15:23:54,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:54,848 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-12-09 15:23:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:23:54,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-09 15:23:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:54,848 INFO L225 Difference]: With dead ends: 42 [2018-12-09 15:23:54,848 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 15:23:54,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-12-09 15:23:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 15:23:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 15:23:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 15:23:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-12-09 15:23:54,850 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 23 [2018-12-09 15:23:54,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:54,850 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-12-09 15:23:54,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:23:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-12-09 15:23:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 15:23:54,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:54,851 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:54,851 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:54,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:54,851 INFO L82 PathProgramCache]: Analyzing trace with hash 175945834, now seen corresponding path program 1 times [2018-12-09 15:23:54,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:54,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:54,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:54,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:54,987 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 15:23:54,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:54,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 15:23:54,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:54,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 15:23:54,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 15:23:54,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-12-09 15:23:54,988 INFO L87 Difference]: Start difference. First operand 42 states and 41 transitions. Second operand 15 states. [2018-12-09 15:23:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:55,229 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2018-12-09 15:23:55,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 15:23:55,230 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-12-09 15:23:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:55,230 INFO L225 Difference]: With dead ends: 41 [2018-12-09 15:23:55,231 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 15:23:55,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2018-12-09 15:23:55,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 15:23:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 15:23:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 15:23:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 40 transitions. [2018-12-09 15:23:55,232 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 40 transitions. Word has length 33 [2018-12-09 15:23:55,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:55,233 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 40 transitions. [2018-12-09 15:23:55,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 15:23:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2018-12-09 15:23:55,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 15:23:55,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:55,233 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:55,233 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:55,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:55,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1159353522, now seen corresponding path program 1 times [2018-12-09 15:23:55,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:55,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:55,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:55,413 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 15:23:55,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:23:55,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 15:23:55,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:23:55,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 15:23:55,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 15:23:55,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-09 15:23:55,414 INFO L87 Difference]: Start difference. First operand 41 states and 40 transitions. Second operand 16 states. [2018-12-09 15:23:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:23:55,673 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2018-12-09 15:23:55,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 15:23:55,674 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-12-09 15:23:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:23:55,674 INFO L225 Difference]: With dead ends: 40 [2018-12-09 15:23:55,674 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 15:23:55,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-12-09 15:23:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 15:23:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 15:23:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 15:23:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 39 transitions. [2018-12-09 15:23:55,676 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 39 transitions. Word has length 34 [2018-12-09 15:23:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:23:55,676 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 39 transitions. [2018-12-09 15:23:55,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 15:23:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 39 transitions. [2018-12-09 15:23:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 15:23:55,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:55,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:55,678 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION]=== [2018-12-09 15:23:55,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:55,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1613541487, now seen corresponding path program 1 times [2018-12-09 15:23:55,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:23:55,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:55,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:55,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:23:55,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:23:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:23:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:23:55,710 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 15:23:55,719 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 15:23:55,725 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 15:23:55,726 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 15:23:55,726 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 18 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 15:23:55,726 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 15:23:55,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:23:55 BoogieIcfgContainer [2018-12-09 15:23:55,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:23:55,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:23:55,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:23:55,734 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:23:55,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:23:52" (3/4) ... [2018-12-09 15:23:55,737 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 15:23:55,737 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:23:55,737 INFO L168 Benchmark]: Toolchain (without parser) took 4001.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.6 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -269.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-09 15:23:55,738 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:23:55,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -140.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:23:55,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.33 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-09 15:23:55,739 INFO L168 Benchmark]: Boogie Preprocessor took 15.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:23:55,739 INFO L168 Benchmark]: RCFGBuilder took 191.19 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-12-09 15:23:55,740 INFO L168 Benchmark]: TraceAbstraction took 3412.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -165.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2018-12-09 15:23:55,740 INFO L168 Benchmark]: Witness Printer took 3.20 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:23:55,742 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 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -140.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.33 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 191.19 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3412.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -165.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.20 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 18 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1454]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1454. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L1434] struct ldv_list_head global_list_13 = { &(global_list_13), &(global_list_13) }; VAL [\old(global_list_13)=null, \old(global_list_13)=null, \old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1455] CALL entry_point() VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1449] CALL alloc_13() VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1442] CALL, EXPR ldv_malloc(sizeof(struct A13)) VAL [\old(size)=12, global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=12, \result={24:0}, global_list_13={21:0}, ldv_global_msg_list={1:0}, malloc(size)={24:0}, size=12] [L1442] RET, EXPR ldv_malloc(sizeof(struct A13)) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(struct A13))={24:0}] [L1442] struct A13 *p = (struct A13 *)ldv_malloc(sizeof(struct A13)); [L1443] COND TRUE \read(*p) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, p={24:0}] [L1444] CALL ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={21:0}, head={21:0}, ldv_global_msg_list={1:0}, new={24:4}] [L1121] EXPR head->next VAL [global_list_13={21:0}, head={21:0}, head={21:0}, head->next={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}] [L1121] CALL __ldv_list_add(new, head, head->next) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, new={24:4}, next={21:0}, prev={21:0}] [L1107] next->prev = new VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}, next={21:0}, next={21:0}, prev={21:0}, prev={21:0}] [L1108] new->next = next VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}, next={21:0}, next={21:0}, prev={21:0}, prev={21:0}] [L1109] new->prev = prev VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}, next={21:0}, next={21:0}, prev={21:0}, prev={21:0}] [L1110] prev->next = new VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}, next={21:0}, next={21:0}, prev={21:0}, prev={21:0}] [L1121] RET __ldv_list_add(new, head, head->next) VAL [global_list_13={21:0}, head={21:0}, head={21:0}, head->next={21:0}, ldv_global_msg_list={1:0}, new={24:4}, new={24:4}] [L1444] RET ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, p={24:0}] [L1449] RET alloc_13() VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1451] CALL LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, list={21:0}] [L1099] list->next = list VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, list={21:0}, list={21:0}] [L1100] list->prev = list VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}, list={21:0}, list={21:0}] [L1451] RET LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}] [L1455] RET entry_point() VAL [global_list_13={21:0}, ldv_global_msg_list={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 57 locations, 15 error locations. UNSAFE Result, 3.3s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 492 SDtfs, 687 SDslu, 1494 SDs, 0 SdLazy, 1894 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 53276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:23:57,056 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:23:57,057 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:23:57,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:23:57,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:23:57,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:23:57,064 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:23:57,065 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:23:57,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:23:57,066 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:23:57,067 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:23:57,067 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:23:57,067 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:23:57,068 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:23:57,068 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:23:57,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:23:57,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:23:57,070 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:23:57,071 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:23:57,071 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:23:57,072 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:23:57,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:23:57,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:23:57,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:23:57,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:23:57,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:23:57,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:23:57,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:23:57,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:23:57,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:23:57,076 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:23:57,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:23:57,077 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:23:57,077 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:23:57,077 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:23:57,077 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:23:57,078 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 15:23:57,085 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:23:57,085 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:23:57,086 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:23:57,086 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:23:57,086 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 15:23:57,086 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 15:23:57,086 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 15:23:57,086 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 15:23:57,086 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 15:23:57,086 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 15:23:57,087 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:23:57,087 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:23:57,087 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:23:57,087 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:23:57,087 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 15:23:57,087 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:23:57,087 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:23:57,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:23:57,087 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 15:23:57,087 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 15:23:57,088 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 15:23:57,088 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:23:57,088 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 15:23:57,088 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 15:23:57,088 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:23:57,088 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:23:57,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:23:57,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:23:57,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:23:57,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:23:57,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:23:57,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:23:57,089 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:23:57,089 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 15:23:57,089 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:23:57,089 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 15:23:57,089 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_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba5476636e8902440a35b69190524704fd5af5c4 [2018-12-09 15:23:57,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:23:57,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:23:57,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:23:57,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:23:57,121 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:23:57,122 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-09 15:23:57,165 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/data/2c71d3508/c4ef304faf2e46ec86957242f1cf2d52/FLAGf553910d3 [2018-12-09 15:23:57,601 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:23:57,601 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/sv-benchmarks/c/ldv-memsafety/memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-09 15:23:57,609 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/data/2c71d3508/c4ef304faf2e46ec86957242f1cf2d52/FLAGf553910d3 [2018-12-09 15:23:57,618 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/data/2c71d3508/c4ef304faf2e46ec86957242f1cf2d52 [2018-12-09 15:23:57,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:23:57,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:23:57,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:23:57,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:23:57,623 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:23:57,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:23:57" (1/1) ... [2018-12-09 15:23:57,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4096dacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57, skipping insertion in model container [2018-12-09 15:23:57,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:23:57" (1/1) ... [2018-12-09 15:23:57,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:23:57,659 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:23:57,856 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:23:57,868 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:23:57,937 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:23:57,980 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:23:57,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57 WrapperNode [2018-12-09 15:23:57,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:23:57,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:23:57,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:23:57,981 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:23:57,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57" (1/1) ... [2018-12-09 15:23:57,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57" (1/1) ... [2018-12-09 15:23:58,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:23:58,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:23:58,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:23:58,003 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:23:58,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57" (1/1) ... [2018-12-09 15:23:58,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57" (1/1) ... [2018-12-09 15:23:58,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57" (1/1) ... [2018-12-09 15:23:58,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57" (1/1) ... [2018-12-09 15:23:58,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57" (1/1) ... [2018-12-09 15:23:58,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57" (1/1) ... [2018-12-09 15:23:58,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57" (1/1) ... [2018-12-09 15:23:58,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:23:58,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:23:58,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:23:58,021 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:23:58,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:23:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:23:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-09 15:23:58,053 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-09 15:23:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-12-09 15:23:58,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-12-09 15:23:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 15:23:58,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 15:23:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-12-09 15:23:58,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-12-09 15:23:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2018-12-09 15:23:58,053 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2018-12-09 15:23:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:23:58,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:23:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:23:58,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:23:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 15:23:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 15:23:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 15:23:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 15:23:58,054 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 15:23:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:23:58,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:23:58,281 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:23:58,281 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 15:23:58,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:23:58 BoogieIcfgContainer [2018-12-09 15:23:58,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:23:58,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:23:58,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:23:58,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:23:58,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:23:57" (1/3) ... [2018-12-09 15:23:58,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33704fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:23:58, skipping insertion in model container [2018-12-09 15:23:58,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:57" (2/3) ... [2018-12-09 15:23:58,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33704fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:23:58, skipping insertion in model container [2018-12-09 15:23:58,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:23:58" (3/3) ... [2018-12-09 15:23:58,285 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_1_false-valid-memtrack_true-termination.i [2018-12-09 15:23:58,291 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:23:58,295 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 15:23:58,303 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 15:23:58,317 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 15:23:58,317 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:23:58,317 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 15:23:58,318 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:23:58,318 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:23:58,318 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:23:58,318 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:23:58,318 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:23:58,318 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:23:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-12-09 15:23:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 15:23:58,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:23:58,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:23:58,332 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:23:58,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:23:58,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1206133031, now seen corresponding path program 1 times [2018-12-09 15:23:58,338 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:23:58,338 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:23:58,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:23:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:23:58,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:23:58,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 15:23:58,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:23:58,479 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 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 15:23:58,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:23:58,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:23:58,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 15:23:58,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 15:23:58,536 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 15 treesize of output 14 [2018-12-09 15:23:58,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:23:58,563 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 15:23:58,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 15:23:58,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 15:23:58,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:71 [2018-12-09 15:23:58,667 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 9 treesize of output 7 [2018-12-09 15:23:58,670 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 15:23:58,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:23:58,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:23:58,674 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 15:23:58,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2018-12-09 15:23:58,698 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 15:23:58,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:23:58,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:23:58,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2018-12-09 15:24:00,722 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 15:24:00,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:00,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:00,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 15:24:00,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:00,741 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 15:24:00,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-09 15:24:00,801 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 15:24:00,802 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:24:00,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:24:00,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 15:24:00,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:24:00,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:24:00,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2018-12-09 15:24:00,822 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 9 states. [2018-12-09 15:24:01,955 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-12-09 15:24:03,218 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-12-09 15:24:04,540 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-12-09 15:24:04,971 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 15:24:10,020 WARN L180 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-12-09 15:24:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:24:12,158 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-12-09 15:24:12,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 15:24:12,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-12-09 15:24:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:24:12,167 INFO L225 Difference]: With dead ends: 92 [2018-12-09 15:24:12,168 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 15:24:12,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=72, Invalid=141, Unknown=1, NotChecked=26, Total=240 [2018-12-09 15:24:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 15:24:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2018-12-09 15:24:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 15:24:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-12-09 15:24:12,198 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2018-12-09 15:24:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:24:12,199 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-12-09 15:24:12,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:24:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-12-09 15:24:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 15:24:12,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:24:12,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:24:12,200 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:24:12,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:24:12,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1206133030, now seen corresponding path program 1 times [2018-12-09 15:24:12,201 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:24:12,201 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:24:12,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:24:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:24:12,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:24:12,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 15:24:12,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:12,309 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 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 15:24:12,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:12,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:12,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 15:24:12,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 15:24:12,364 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 15 treesize of output 14 [2018-12-09 15:24:12,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 15:24:12,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 15:24:12,473 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 9 treesize of output 12 [2018-12-09 15:24:12,478 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 15:24:12,479 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,484 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 15:24:12,510 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:34, output treesize:110 [2018-12-09 15:24:12,575 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 30 treesize of output 28 [2018-12-09 15:24:12,577 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 15:24:12,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,606 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 30 treesize of output 28 [2018-12-09 15:24:12,608 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 15:24:12,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:24:12,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-12-09 15:24:12,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:12,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:12,677 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 27 treesize of output 19 [2018-12-09 15:24:12,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,703 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 14 [2018-12-09 15:24:12,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-09 15:24:12,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,739 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 10 [2018-12-09 15:24:12,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:24:12,748 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:10 [2018-12-09 15:24:17,551 WARN L180 SmtUtils]: Spent 888.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-09 15:24:17,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:17,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:17,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:17,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-09 15:24:17,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:17,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-12-09 15:24:17,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:17,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:17,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:24:17,659 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 32 treesize of output 24 [2018-12-09 15:24:17,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:24:17,709 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 2 case distinctions, treesize of input 24 treesize of output 27 [2018-12-09 15:24:17,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 15:24:17,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:24:17,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:65, output treesize:28 [2018-12-09 15:24:18,761 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 15:24:18,761 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:24:18,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:24:18,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 15:24:18,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:24:18,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:24:18,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=50, Unknown=4, NotChecked=0, Total=72 [2018-12-09 15:24:18,764 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 9 states. [2018-12-09 15:24:31,912 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2018-12-09 15:25:29,617 WARN L180 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-12-09 15:25:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:31,245 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-12-09 15:25:31,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:25:31,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-12-09 15:25:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:25:31,246 INFO L225 Difference]: With dead ends: 79 [2018-12-09 15:25:31,246 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 15:25:31,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=71, Invalid=152, Unknown=17, NotChecked=0, Total=240 [2018-12-09 15:25:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 15:25:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-12-09 15:25:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 15:25:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-09 15:25:31,251 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 17 [2018-12-09 15:25:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:25:31,251 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-09 15:25:31,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:25:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-09 15:25:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:25:31,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:25:31,252 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 15:25:31,252 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:25:31,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:31,252 INFO L82 PathProgramCache]: Analyzing trace with hash -212703262, now seen corresponding path program 1 times [2018-12-09 15:25:31,252 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:25:31,252 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:25:31,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:31,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:25:31,340 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 7 treesize of output 5 [2018-12-09 15:25:31,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 15:25:31,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:25:31,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:25:31,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:25:31,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-12-09 15:25:31,387 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 22 treesize of output 16 [2018-12-09 15:25:31,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 15:25:31,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:25:31,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:25:31,393 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 15:25:31,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2018-12-09 15:25:31,424 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 15:25:31,424 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:25:31,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:31,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 15:25:31,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:25:31,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:25:31,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:25:31,426 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 9 states. [2018-12-09 15:25:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:31,956 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-12-09 15:25:31,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 15:25:31,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-12-09 15:25:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:25:31,957 INFO L225 Difference]: With dead ends: 78 [2018-12-09 15:25:31,957 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 15:25:31,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-09 15:25:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 15:25:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2018-12-09 15:25:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 15:25:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-12-09 15:25:31,961 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 20 [2018-12-09 15:25:31,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:25:31,961 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-12-09 15:25:31,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:25:31,961 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-12-09 15:25:31,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:25:31,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:25:31,962 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 15:25:31,962 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:25:31,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:31,962 INFO L82 PathProgramCache]: Analyzing trace with hash -212703261, now seen corresponding path program 1 times [2018-12-09 15:25:31,962 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:25:31,962 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:25:31,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:32,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:25:32,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 15:25:32,074 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 15:25:32,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:25:32,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:25:32,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 15:25:32,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:25:32,114 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 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 15:25:32,117 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 15 treesize of output 14 [2018-12-09 15:25:32,117 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 15:25:32,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:25:32,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:25:32,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 15:25:32,163 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 15:25:32,182 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 15:25:32,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 15:25:32,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 15:25:32,225 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:48, output treesize:152 [2018-12-09 15:25:32,346 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 50 treesize of output 40 [2018-12-09 15:25:32,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:25:32,393 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 40 treesize of output 33 [2018-12-09 15:25:32,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:25:32,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:25:32,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:101, output treesize:33 [2018-12-09 15:25:36,574 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 15:25:36,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:25:36,586 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 55 treesize of output 58 [2018-12-09 15:25:36,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:25:36,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:25:36,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:25:36,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:25:36,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-12-09 15:25:36,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:25:36,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:25:36,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:25:36,762 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 55 treesize of output 47 [2018-12-09 15:25:36,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:25:36,853 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 2 case distinctions, treesize of input 47 treesize of output 50 [2018-12-09 15:25:36,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 15:25:36,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:25:36,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:111, output treesize:74 [2018-12-09 15:25:38,821 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 15:25:38,823 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 15:25:38,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:25:38,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:25:38,843 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 22 treesize of output 16 [2018-12-09 15:25:38,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 15:25:38,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:25:38,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:25:38,852 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 15:25:38,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:9 [2018-12-09 15:25:38,919 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 15:25:38,919 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:25:38,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:38,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 15:25:38,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 15:25:38,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 15:25:38,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=87, Unknown=3, NotChecked=0, Total=110 [2018-12-09 15:25:38,921 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 11 states. [2018-12-09 15:25:53,119 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-12-09 15:26:05,931 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-12-09 15:26:13,589 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2018-12-09 15:26:18,023 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2018-12-09 15:26:31,807 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-12-09 15:26:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:26:38,817 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-09 15:26:38,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 15:26:38,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-09 15:26:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:26:38,819 INFO L225 Difference]: With dead ends: 71 [2018-12-09 15:26:38,819 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 15:26:38,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=78, Invalid=249, Unknown=15, NotChecked=0, Total=342 [2018-12-09 15:26:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 15:26:38,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2018-12-09 15:26:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 15:26:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-12-09 15:26:38,823 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 20 [2018-12-09 15:26:38,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:26:38,823 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-12-09 15:26:38,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 15:26:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-12-09 15:26:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 15:26:38,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:26:38,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:26:38,824 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:26:38,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:26:38,824 INFO L82 PathProgramCache]: Analyzing trace with hash 594701227, now seen corresponding path program 1 times [2018-12-09 15:26:38,824 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:26:38,824 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:26:38,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:38,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:26:38,869 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 15:26:38,869 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:26:38,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:26:38,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:26:38,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:26:38,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:26:38,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:26:38,872 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-12-09 15:26:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:26:38,879 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-12-09 15:26:38,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:26:38,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-09 15:26:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:26:38,880 INFO L225 Difference]: With dead ends: 58 [2018-12-09 15:26:38,880 INFO L226 Difference]: Without dead ends: 58 [2018-12-09 15:26:38,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:26:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-09 15:26:38,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-09 15:26:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 15:26:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-09 15:26:38,883 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 19 [2018-12-09 15:26:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:26:38,883 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-09 15:26:38,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:26:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-09 15:26:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 15:26:38,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:26:38,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:26:38,884 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:26:38,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:26:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash 398187722, now seen corresponding path program 1 times [2018-12-09 15:26:38,884 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:26:38,884 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:26:38,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:38,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:26:38,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 15:26:38,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:26:38,946 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 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 15:26:38,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 15:26:38,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:38,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:26:38,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:26:38,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 15:26:38,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 15:26:39,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 15:26:39,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 15:26:39,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 15:26:39,049 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:71 [2018-12-09 15:26:39,079 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 9 treesize of output 7 [2018-12-09 15:26:39,081 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 15:26:39,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:39,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:39,083 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 15:26:39,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2018-12-09 15:26:39,092 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 15:26:39,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:39,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:39,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2018-12-09 15:26:39,116 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 15:26:39,116 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:26:39,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:26:39,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:26:39,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:26:39,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:26:39,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:26:39,118 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 7 states. [2018-12-09 15:26:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:26:45,521 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-12-09 15:26:45,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 15:26:45,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-09 15:26:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:26:45,522 INFO L225 Difference]: With dead ends: 66 [2018-12-09 15:26:45,522 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 15:26:45,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-09 15:26:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 15:26:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-09 15:26:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 15:26:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-12-09 15:26:45,526 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 19 [2018-12-09 15:26:45,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:26:45,526 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-12-09 15:26:45,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:26:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-12-09 15:26:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 15:26:45,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:26:45,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:26:45,527 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:26:45,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:26:45,528 INFO L82 PathProgramCache]: Analyzing trace with hash 398187723, now seen corresponding path program 1 times [2018-12-09 15:26:45,528 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:26:45,528 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/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 15:26:45,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:45,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:26:45,583 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 9 treesize of output 12 [2018-12-09 15:26:45,587 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 15:26:45,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:45,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:45,601 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 15:26:45,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2018-12-09 15:26:45,620 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 9 treesize of output 7 [2018-12-09 15:26:45,622 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 15:26:45,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:45,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:45,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:45,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2018-12-09 15:26:45,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 15:26:45,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:45,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:45,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 15:26:45,667 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 15:26:45,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:26:45,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:26:45,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:26:45,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:26:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:26:45,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:26:45,669 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 7 states. [2018-12-09 15:26:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:26:46,129 INFO L93 Difference]: Finished difference Result 86 states and 85 transitions. [2018-12-09 15:26:46,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:26:46,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-09 15:26:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:26:46,130 INFO L225 Difference]: With dead ends: 86 [2018-12-09 15:26:46,130 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 15:26:46,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-09 15:26:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 15:26:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2018-12-09 15:26:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 15:26:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-12-09 15:26:46,132 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-12-09 15:26:46,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:26:46,133 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-12-09 15:26:46,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:26:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-12-09 15:26:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 15:26:46,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:26:46,133 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] [2018-12-09 15:26:46,133 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:26:46,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:26:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1996133472, now seen corresponding path program 1 times [2018-12-09 15:26:46,133 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:26:46,133 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:26:46,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:46,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:26:46,207 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 15:26:46,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:46,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:46,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 15:26:46,254 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 15:26:46,254 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:26:46,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:26:46,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 15:26:46,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:26:46,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:26:46,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:26:46,256 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 9 states. [2018-12-09 15:26:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:26:46,628 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2018-12-09 15:26:46,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:26:46,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-09 15:26:46,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:26:46,629 INFO L225 Difference]: With dead ends: 64 [2018-12-09 15:26:46,629 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 15:26:46,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:26:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 15:26:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-12-09 15:26:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 15:26:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-09 15:26:46,631 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 21 [2018-12-09 15:26:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:26:46,632 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-09 15:26:46,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:26:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-09 15:26:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 15:26:46,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:26:46,632 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] [2018-12-09 15:26:46,632 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:26:46,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:26:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1996133473, now seen corresponding path program 1 times [2018-12-09 15:26:46,632 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:26:46,633 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:26:46,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:46,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:26:46,729 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 15:26:46,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:46,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:46,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 15:26:46,821 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 15:26:46,821 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:26:46,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:26:46,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:26:46,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:26:46,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:26:46,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:26:46,824 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 10 states. [2018-12-09 15:26:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:26:47,242 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2018-12-09 15:26:47,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:26:47,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-09 15:26:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:26:47,243 INFO L225 Difference]: With dead ends: 62 [2018-12-09 15:26:47,243 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 15:26:47,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-09 15:26:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 15:26:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-12-09 15:26:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 15:26:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-09 15:26:47,246 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 21 [2018-12-09 15:26:47,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:26:47,246 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-09 15:26:47,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:26:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-09 15:26:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 15:26:47,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:26:47,246 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] [2018-12-09 15:26:47,247 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:26:47,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:26:47,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2125216191, now seen corresponding path program 1 times [2018-12-09 15:26:47,247 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:26:47,247 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:26:47,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:47,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:26:47,332 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 15:26:47,333 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:26:47,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:26:47,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:26:47,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:26:47,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:26:47,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:26:47,335 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 5 states. [2018-12-09 15:26:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:26:47,342 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-12-09 15:26:47,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:26:47,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-09 15:26:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:26:47,343 INFO L225 Difference]: With dead ends: 48 [2018-12-09 15:26:47,343 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 15:26:47,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:26:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 15:26:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 15:26:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 15:26:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2018-12-09 15:26:47,345 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 21 [2018-12-09 15:26:47,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:26:47,345 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2018-12-09 15:26:47,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:26:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2018-12-09 15:26:47,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 15:26:47,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:26:47,346 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 15:26:47,346 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:26:47,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:26:47,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1566114557, now seen corresponding path program 1 times [2018-12-09 15:26:47,346 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:26:47,346 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/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 15:26:47,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:47,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:26:47,439 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 9 treesize of output 7 [2018-12-09 15:26:47,441 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 15:26:47,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:47,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:47,442 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 15:26:47,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2018-12-09 15:26:47,460 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 15:26:47,460 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:26:47,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:26:47,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:26:47,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:26:47,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:26:47,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:26:47,463 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 6 states. [2018-12-09 15:26:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:26:47,681 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-12-09 15:26:47,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:26:47,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-09 15:26:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:26:47,682 INFO L225 Difference]: With dead ends: 43 [2018-12-09 15:26:47,682 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 15:26:47,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:26:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 15:26:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 15:26:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 15:26:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2018-12-09 15:26:47,684 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 23 [2018-12-09 15:26:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:26:47,684 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2018-12-09 15:26:47,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:26:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2018-12-09 15:26:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 15:26:47,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:26:47,684 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 15:26:47,684 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:26:47,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:26:47,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1566114556, now seen corresponding path program 1 times [2018-12-09 15:26:47,685 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:26:47,685 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:26:47,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:47,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:26:47,820 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 15:26:47,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-09 15:26:47,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:47,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:47,838 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 22 treesize of output 16 [2018-12-09 15:26:47,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-09 15:26:47,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:47,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:47,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:47,851 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:10 [2018-12-09 15:26:47,920 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 15:26:47,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:26:47,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:26:47,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 15:26:47,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:26:47,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:26:47,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:26:47,922 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 9 states. [2018-12-09 15:26:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:26:48,402 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-12-09 15:26:48,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:26:48,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-09 15:26:48,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:26:48,403 INFO L225 Difference]: With dead ends: 42 [2018-12-09 15:26:48,403 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 15:26:48,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-09 15:26:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 15:26:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 15:26:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 15:26:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-12-09 15:26:48,405 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 23 [2018-12-09 15:26:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:26:48,405 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-12-09 15:26:48,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:26:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-12-09 15:26:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 15:26:48,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:26:48,405 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:26:48,405 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:26:48,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:26:48,406 INFO L82 PathProgramCache]: Analyzing trace with hash 175945834, now seen corresponding path program 1 times [2018-12-09 15:26:48,406 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:26:48,406 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:26:48,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:48,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:26:48,522 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 7 treesize of output 5 [2018-12-09 15:26:48,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 15:26:48,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:48,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:48,537 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 15:26:48,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:26:48,540 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 13 treesize of output 6 [2018-12-09 15:26:48,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:48,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:48,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:48,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2018-12-09 15:26:48,759 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 32 treesize of output 26 [2018-12-09 15:26:48,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:26:48,764 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 26 treesize of output 18 [2018-12-09 15:26:48,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:48,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:48,783 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 15:26:48,785 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 15:26:48,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:26:48,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:48,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:26:48,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:11 [2018-12-09 15:26:48,880 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 15:26:48,880 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 15:26:48,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:26:48,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 15:26:48,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 15:26:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 15:26:48,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-09 15:26:48,883 INFO L87 Difference]: Start difference. First operand 42 states and 41 transitions. Second operand 14 states. [2018-12-09 15:26:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:26:50,239 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2018-12-09 15:26:50,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 15:26:50,240 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-12-09 15:26:50,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:26:50,240 INFO L225 Difference]: With dead ends: 40 [2018-12-09 15:26:50,241 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 15:26:50,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-12-09 15:26:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 15:26:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 15:26:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 15:26:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 39 transitions. [2018-12-09 15:26:50,242 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 39 transitions. Word has length 33 [2018-12-09 15:26:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:26:50,242 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 39 transitions. [2018-12-09 15:26:50,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 15:26:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 39 transitions. [2018-12-09 15:26:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 15:26:50,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:26:50,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:26:50,243 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION]=== [2018-12-09 15:26:50,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:26:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1613541487, now seen corresponding path program 1 times [2018-12-09 15:26:50,243 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 15:26:50,244 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76ff82b6-794b-48b3-b0f3-0812eb1bbb9b/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 15:26:50,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:26:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:26:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:26:50,629 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 15:26:50,640 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 15:26:50,646 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 15:26:50,646 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 15:26:50,646 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 15:26:50,647 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 15:26:50,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:26:50 BoogieIcfgContainer [2018-12-09 15:26:50,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:26:50,655 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:26:50,655 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:26:50,655 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:26:50,655 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:23:58" (3/4) ... [2018-12-09 15:26:50,658 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 15:26:50,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:26:50,658 INFO L168 Benchmark]: Toolchain (without parser) took 173038.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 939.3 MB in the beginning and 951.6 MB in the end (delta: -12.3 MB). Peak memory consumption was 206.4 MB. Max. memory is 11.5 GB. [2018-12-09 15:26:50,659 INFO L168 Benchmark]: CDTParser took 0.20 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 15:26:50,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-09 15:26:50,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.71 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:26:50,659 INFO L168 Benchmark]: Boogie Preprocessor took 17.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:26:50,659 INFO L168 Benchmark]: RCFGBuilder took 261.04 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-12-09 15:26:50,659 INFO L168 Benchmark]: TraceAbstraction took 172372.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.0 MB). Free memory was 1.1 GB in the beginning and 951.6 MB in the end (delta: 102.8 MB). Peak memory consumption was 200.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:26:50,659 INFO L168 Benchmark]: Witness Printer took 3.15 ms. Allocated memory is still 1.2 GB. Free memory is still 951.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:26:50,660 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.20 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 360.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.71 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 261.04 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 172372.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.0 MB). Free memory was 1.1 GB in the beginning and 951.6 MB in the end (delta: 102.8 MB). Peak memory consumption was 200.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.15 ms. Allocated memory is still 1.2 GB. Free memory is still 951.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1454]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1454. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L1434] struct ldv_list_head global_list_13 = { &(global_list_13), &(global_list_13) }; VAL [\old(global_list_13)=null, \old(global_list_13)=null, \old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1455] CALL entry_point() VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1449] CALL alloc_13() VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1442] CALL, EXPR ldv_malloc(sizeof(struct A13)) VAL [\old(size)=12, global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=12, \result={536870900:0}, global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, malloc(size)={536870900:0}, size=12] [L1442] RET, EXPR ldv_malloc(sizeof(struct A13)) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, ldv_malloc(sizeof(struct A13))={536870900:0}] [L1442] struct A13 *p = (struct A13 *)ldv_malloc(sizeof(struct A13)); [L1443] COND TRUE \read(*p) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, p={536870900:0}] [L1444] CALL ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={-536870909:0}, head={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}] [L1121] EXPR head->next VAL [global_list_13={-536870909:0}, head={-536870909:0}, head={-536870909:0}, head->next={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}] [L1121] CALL __ldv_list_add(new, head, head->next) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, next={-536870909:0}, prev={-536870909:0}] [L1107] next->prev = new VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}, next={-536870909:0}, next={-536870909:0}, prev={-536870909:0}, prev={-536870909:0}] [L1108] new->next = next VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}, next={-536870909:0}, next={-536870909:0}, prev={-536870909:0}, prev={-536870909:0}] [L1109] new->prev = prev VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}, next={-536870909:0}, next={-536870909:0}, prev={-536870909:0}, prev={-536870909:0}] [L1110] prev->next = new VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}, next={-536870909:0}, next={-536870909:0}, prev={-536870909:0}, prev={-536870909:0}] [L1121] RET __ldv_list_add(new, head, head->next) VAL [global_list_13={-536870909:0}, head={-536870909:0}, head={-536870909:0}, head->next={-536870909:0}, ldv_global_msg_list={-536870901:0}, new={536870900:4}, new={536870900:4}] [L1444] RET ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, p={536870900:0}] [L1449] RET alloc_13() VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1451] CALL LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, list={-536870909:0}] [L1099] list->next = list VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, list={-536870909:0}, list={-536870909:0}] [L1100] list->prev = list VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}, list={-536870909:0}, list={-536870909:0}] [L1451] RET LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] [L1455] RET entry_point() VAL [global_list_13={-536870909:0}, ldv_global_msg_list={-536870901:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 57 locations, 15 error locations. UNSAFE Result, 172.3s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 154.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 493 SDtfs, 688 SDslu, 1530 SDs, 0 SdLazy, 1819 SolverSat, 312 SolverUnsat, 66 SolverUnknown, 0 SolverNotchecked, 104.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 161 SyntacticMatches, 15 SemanticMatches, 151 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 63.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 260 ConstructedInterpolants, 17 QuantifiedInterpolants, 73260 SizeOfPredicates, 133 NumberOfNonLiveVariables, 1673 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...