./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_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_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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 db24912fd6b7f93a8f38fa3f07abfebcff2c46e9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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 db24912fd6b7f93a8f38fa3f07abfebcff2c46e9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 12:00:06,415 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:00:06,416 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:00:06,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:00:06,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:00:06,423 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:00:06,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:00:06,424 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:00:06,425 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:00:06,426 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:00:06,426 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:00:06,426 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:00:06,427 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:00:06,427 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:00:06,427 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:00:06,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:00:06,428 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:00:06,429 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:00:06,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:00:06,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:00:06,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:00:06,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:00:06,433 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:00:06,433 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:00:06,433 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:00:06,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:00:06,434 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:00:06,435 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:00:06,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:00:06,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:00:06,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:00:06,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:00:06,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:00:06,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:00:06,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:00:06,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:00:06,437 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 12:00:06,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:00:06,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:00:06,445 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:00:06,445 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:00:06,446 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:00:06,446 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:00:06,446 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:00:06,446 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 12:00:06,446 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:00:06,446 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:00:06,446 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 12:00:06,446 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 12:00:06,446 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:00:06,447 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 12:00:06,447 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 12:00:06,447 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:00:06,447 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:00:06,447 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 12:00:06,447 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:00:06,447 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:00:06,447 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:00:06,447 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 12:00:06,447 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 12:00:06,447 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 12:00:06,448 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:00:06,448 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:00:06,448 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:00:06,448 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:00:06,448 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:00:06,448 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:00:06,448 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:00:06,448 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:00:06,448 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:00:06,448 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 12:00:06,448 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:00:06,449 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:00:06,449 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_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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 -> db24912fd6b7f93a8f38fa3f07abfebcff2c46e9 [2018-12-02 12:00:06,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:00:06,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:00:06,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:00:06,478 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:00:06,478 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:00:06,479 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-02 12:00:06,516 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/data/0b9625305/e2140b1d781e43998443323de2f1fdee/FLAG93e9a25c8 [2018-12-02 12:00:07,024 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:00:07,025 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-02 12:00:07,032 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/data/0b9625305/e2140b1d781e43998443323de2f1fdee/FLAG93e9a25c8 [2018-12-02 12:00:07,040 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/data/0b9625305/e2140b1d781e43998443323de2f1fdee [2018-12-02 12:00:07,042 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:00:07,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:00:07,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:00:07,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:00:07,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:00:07,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:00:07" (1/1) ... [2018-12-02 12:00:07,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5fc0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07, skipping insertion in model container [2018-12-02 12:00:07,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:00:07" (1/1) ... [2018-12-02 12:00:07,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:00:07,073 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:00:07,287 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:00:07,295 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:00:07,328 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:00:07,361 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:00:07,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07 WrapperNode [2018-12-02 12:00:07,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:00:07,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:00:07,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:00:07,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:00:07,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07" (1/1) ... [2018-12-02 12:00:07,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07" (1/1) ... [2018-12-02 12:00:07,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:00:07,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:00:07,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:00:07,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:00:07,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07" (1/1) ... [2018-12-02 12:00:07,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07" (1/1) ... [2018-12-02 12:00:07,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07" (1/1) ... [2018-12-02 12:00:07,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07" (1/1) ... [2018-12-02 12:00:07,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07" (1/1) ... [2018-12-02 12:00:07,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07" (1/1) ... [2018-12-02 12:00:07,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07" (1/1) ... [2018-12-02 12:00:07,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:00:07,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:00:07,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:00:07,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:00:07,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:00:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 12:00:07,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 12:00:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 12:00:07,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 12:00:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 12:00:07,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 12:00:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 12:00:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2018-12-02 12:00:07,433 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2018-12-02 12:00:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2018-12-02 12:00:07,433 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2018-12-02 12:00:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-12-02 12:00:07,433 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-12-02 12:00:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:00:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 12:00:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 12:00:07,433 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 12:00:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:00:07,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:00:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-12-02 12:00:07,433 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-12-02 12:00:07,583 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:00:07,583 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 12:00:07,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:00:07 BoogieIcfgContainer [2018-12-02 12:00:07,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:00:07,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:00:07,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:00:07,586 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:00:07,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:00:07" (1/3) ... [2018-12-02 12:00:07,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d5b4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:00:07, skipping insertion in model container [2018-12-02 12:00:07,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:07" (2/3) ... [2018-12-02 12:00:07,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d5b4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:00:07, skipping insertion in model container [2018-12-02 12:00:07,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:00:07" (3/3) ... [2018-12-02 12:00:07,588 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-02 12:00:07,594 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:00:07,600 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-02 12:00:07,609 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-02 12:00:07,625 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:00:07,625 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 12:00:07,625 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:00:07,625 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:00:07,625 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:00:07,625 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:00:07,625 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:00:07,625 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:00:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-02 12:00:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 12:00:07,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:07,641 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-02 12:00:07,642 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-02 12:00:07,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash -387705796, now seen corresponding path program 1 times [2018-12-02 12:00:07,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:07,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:07,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:07,773 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-02 12:00:07,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:07,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:00:07,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:07,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:07,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:07,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:07,788 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2018-12-02 12:00:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:07,831 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-12-02 12:00:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:07,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 12:00:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:07,839 INFO L225 Difference]: With dead ends: 72 [2018-12-02 12:00:07,839 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 12:00:07,840 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-02 12:00:07,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 12:00:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2018-12-02 12:00:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 12:00:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-12-02 12:00:07,866 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2018-12-02 12:00:07,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:07,866 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-12-02 12:00:07,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-12-02 12:00:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 12:00:07,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:07,867 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-02 12:00:07,867 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-02 12:00:07,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:07,868 INFO L82 PathProgramCache]: Analyzing trace with hash -584219301, now seen corresponding path program 1 times [2018-12-02 12:00:07,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:07,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:07,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:07,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:07,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:07,910 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-02 12:00:07,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:07,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:00:07,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:07,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:00:07,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:00:07,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:00:07,912 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-12-02 12:00:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:07,984 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-12-02 12:00:07,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:07,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 12:00:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:07,985 INFO L225 Difference]: With dead ends: 88 [2018-12-02 12:00:07,985 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 12:00:07,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 12:00:07,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-12-02 12:00:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 12:00:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-12-02 12:00:07,991 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 20 [2018-12-02 12:00:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:07,991 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-12-02 12:00:07,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:00:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-12-02 12:00:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 12:00:07,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:07,992 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-02 12:00:07,993 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-02 12:00:07,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:07,993 INFO L82 PathProgramCache]: Analyzing trace with hash -584219300, now seen corresponding path program 1 times [2018-12-02 12:00:07,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:07,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:07,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:07,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:07,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:08,031 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-02 12:00:08,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:08,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:00:08,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:08,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:00:08,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:00:08,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:00:08,032 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 4 states. [2018-12-02 12:00:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:08,101 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-12-02 12:00:08,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:08,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 12:00:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:08,102 INFO L225 Difference]: With dead ends: 106 [2018-12-02 12:00:08,102 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 12:00:08,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 12:00:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-12-02 12:00:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 12:00:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-12-02 12:00:08,107 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 20 [2018-12-02 12:00:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:08,108 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-12-02 12:00:08,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:00:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-12-02 12:00:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:00:08,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:08,108 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] [2018-12-02 12:00:08,109 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-02 12:00:08,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:08,110 INFO L82 PathProgramCache]: Analyzing trace with hash -400934782, now seen corresponding path program 1 times [2018-12-02 12:00:08,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:08,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:08,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:08,136 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-02 12:00:08,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:08,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:00:08,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:08,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:08,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:08,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:08,137 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 5 states. [2018-12-02 12:00:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:08,147 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-12-02 12:00:08,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:08,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 12:00:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:08,148 INFO L225 Difference]: With dead ends: 86 [2018-12-02 12:00:08,148 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 12:00:08,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02 12:00:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 12:00:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-02 12:00:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 12:00:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-12-02 12:00:08,153 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 22 [2018-12-02 12:00:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:08,154 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-12-02 12:00:08,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-12-02 12:00:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 12:00:08,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:08,154 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-02 12:00:08,154 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-02 12:00:08,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash 455923737, now seen corresponding path program 1 times [2018-12-02 12:00:08,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:08,183 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-02 12:00:08,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:08,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:00:08,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:08,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:08,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:08,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:08,184 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 5 states. [2018-12-02 12:00:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:08,218 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-12-02 12:00:08,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:08,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-02 12:00:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:08,220 INFO L225 Difference]: With dead ends: 88 [2018-12-02 12:00:08,220 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 12:00:08,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02 12:00:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 12:00:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-12-02 12:00:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 12:00:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-12-02 12:00:08,224 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 23 [2018-12-02 12:00:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:08,224 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-12-02 12:00:08,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-12-02 12:00:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 12:00:08,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:08,225 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-02 12:00:08,226 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-02 12:00:08,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:08,226 INFO L82 PathProgramCache]: Analyzing trace with hash 162520730, now seen corresponding path program 1 times [2018-12-02 12:00:08,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:08,256 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-02 12:00:08,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:08,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:00:08,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:08,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:08,257 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 5 states. [2018-12-02 12:00:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:08,266 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-12-02 12:00:08,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:08,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-02 12:00:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:08,267 INFO L225 Difference]: With dead ends: 61 [2018-12-02 12:00:08,267 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 12:00:08,267 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-02 12:00:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 12:00:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 12:00:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 12:00:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-12-02 12:00:08,270 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 23 [2018-12-02 12:00:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:08,270 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-12-02 12:00:08,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-12-02 12:00:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:00:08,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:08,271 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] [2018-12-02 12:00:08,272 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-02 12:00:08,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:08,272 INFO L82 PathProgramCache]: Analyzing trace with hash -389142984, now seen corresponding path program 1 times [2018-12-02 12:00:08,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:08,331 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-02 12:00:08,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:08,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:00:08,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:08,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:00:08,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:00:08,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:08,332 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 7 states. [2018-12-02 12:00:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:08,476 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-02 12:00:08,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:00:08,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-02 12:00:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:08,477 INFO L225 Difference]: With dead ends: 61 [2018-12-02 12:00:08,477 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 12:00:08,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:00:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 12:00:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-12-02 12:00:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 12:00:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-12-02 12:00:08,480 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-12-02 12:00:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:08,480 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-12-02 12:00:08,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:00:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-12-02 12:00:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:00:08,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:08,481 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] [2018-12-02 12:00:08,481 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-02 12:00:08,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash -389142983, now seen corresponding path program 1 times [2018-12-02 12:00:08,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:08,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:08,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:08,565 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-02 12:00:08,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:08,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:00:08,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:08,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:00:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:00:08,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:00:08,567 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 8 states. [2018-12-02 12:00:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:08,679 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-12-02 12:00:08,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:00:08,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-02 12:00:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:08,680 INFO L225 Difference]: With dead ends: 54 [2018-12-02 12:00:08,680 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 12:00:08,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-02 12:00:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 12:00:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-02 12:00:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 12:00:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-12-02 12:00:08,683 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 28 [2018-12-02 12:00:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:08,683 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-12-02 12:00:08,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:00:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-12-02 12:00:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:00:08,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:08,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, 1, 1, 1, 1, 1] [2018-12-02 12:00:08,684 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-02 12:00:08,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash -956170858, now seen corresponding path program 1 times [2018-12-02 12:00:08,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:08,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:08,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:08,754 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-02 12:00:08,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:08,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:00:08,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:08,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:00:08,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:00:08,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:08,756 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2018-12-02 12:00:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:08,946 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-02 12:00:08,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:00:08,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-02 12:00:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:08,947 INFO L225 Difference]: With dead ends: 56 [2018-12-02 12:00:08,947 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 12:00:08,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:00:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 12:00:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 12:00:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 12:00:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-02 12:00:08,949 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 28 [2018-12-02 12:00:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:08,950 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-02 12:00:08,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:00:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-02 12:00:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 12:00:08,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:08,950 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] [2018-12-02 12:00:08,951 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-02 12:00:08,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:08,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1235066613, now seen corresponding path program 1 times [2018-12-02 12:00:08,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:08,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:08,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:08,973 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-02 12:00:08,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:08,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:00:08,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:00:08,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:08,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:08,974 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 5 states. [2018-12-02 12:00:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:08,978 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-12-02 12:00:08,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:08,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-02 12:00:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:08,979 INFO L225 Difference]: With dead ends: 42 [2018-12-02 12:00:08,979 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 12:00:08,979 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-02 12:00:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 12:00:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 12:00:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 12:00:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-12-02 12:00:08,981 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 37 [2018-12-02 12:00:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:08,981 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-12-02 12:00:08,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-12-02 12:00:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 12:00:08,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:08,981 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, 1, 1] [2018-12-02 12:00:08,982 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-02 12:00:08,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:08,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1878309586, now seen corresponding path program 1 times [2018-12-02 12:00:08,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:00:08,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:08,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:00:08,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:00:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:00:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:00:09,014 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:00:09,024 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 12:00:09,031 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 12:00:09,031 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-02 12:00:09,031 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 12:00:09,031 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 18 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-02 12:00:09,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:00:09 BoogieIcfgContainer [2018-12-02 12:00:09,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:00:09,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:00:09,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:00:09,039 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:00:09,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:00:07" (3/4) ... [2018-12-02 12:00:09,041 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 12:00:09,042 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:00:09,042 INFO L168 Benchmark]: Toolchain (without parser) took 1999.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 953.5 MB in the beginning and 775.8 MB in the end (delta: 177.6 MB). Peak memory consumption was 290.9 MB. Max. memory is 11.5 GB. [2018-12-02 12:00:09,043 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:00:09,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -129.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-02 12:00:09,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.76 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-02 12:00:09,044 INFO L168 Benchmark]: Boogie Preprocessor took 16.28 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-02 12:00:09,044 INFO L168 Benchmark]: RCFGBuilder took 183.31 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:00:09,044 INFO L168 Benchmark]: TraceAbstraction took 1454.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 775.8 MB in the end (delta: 280.8 MB). Peak memory consumption was 280.8 MB. Max. memory is 11.5 GB. [2018-12-02 12:00:09,044 INFO L168 Benchmark]: Witness Printer took 2.92 ms. Allocated memory is still 1.1 GB. Free memory is still 775.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:00:09,046 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -129.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.76 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. * Boogie Preprocessor took 16.28 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 183.31 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1454.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 775.8 MB in the end (delta: 280.8 MB). Peak memory consumption was 280.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.92 ms. Allocated memory is still 1.1 GB. Free memory is still 775.8 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: IntegerLiteral 9 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 15 could not be translated for associated CType STRUCT~~A?p~*VOID# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10 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~~A?p~*VOID# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1476]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1476. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L1465] struct A a6; VAL [\old(a6)=null, \old(a6)=null, \old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, a6={13:0}, ldv_global_msg_list={14:0}] [L1477] CALL entry_point() VAL [a6={13:0}, ldv_global_msg_list={14:0}] [L1469] CALL, EXPR probe1_6(&a6) VAL [a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}] [L1443] int ret = - -3; VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={13:0}, ldv_global_msg_list={14:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={12:0}, a6={13:0}, ldv_global_msg_list={14:0}, malloc(size)={12:0}, size=4] [L1444] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, ldv_malloc(sizeof(int))={12:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, p={12:0}, ret=3] [L1447] CALL, EXPR f6() VAL [a6={13:0}, ldv_global_msg_list={14:0}] [L1435] return __VERIFIER_nondet_int(); [L1447] RET, EXPR f6() VAL [a={13:0}, a={13:0}, a6={13:0}, f6()=0, ldv_global_msg_list={14:0}, p={12:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, p={12:0}, ret=0] [L1450] CALL, EXPR g6() VAL [a6={13:0}, ldv_global_msg_list={14:0}] [L1439] return __VERIFIER_nondet_int(); [L1450] RET, EXPR g6() VAL [a={13:0}, a={13:0}, a6={13:0}, g6()=0, ldv_global_msg_list={14:0}, p={12:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, p={12:0}, ret=0] [L1453] a->p = p VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, p={12:0}, ret=0] [L1454] return 0; VAL [\result=0, a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, p={12:0}, ret=0] [L1469] RET, EXPR probe1_6(&a6) VAL [a6={13:0}, ldv_global_msg_list={14:0}, probe1_6(&a6)=0] [L1469] int ret = probe1_6(&a6); [L1470] COND TRUE ret==0 VAL [a6={13:0}, ldv_global_msg_list={14:0}, ret=0] [L1471] FCALL disconnect_2_6(&a6) VAL [a6={13:0}, ldv_global_msg_list={14:0}, ret=0] [L1473] a6.p = 0 VAL [a6={13:0}, ldv_global_msg_list={14:0}, ret=0] [L1477] RET entry_point() VAL [a6={13:0}, ldv_global_msg_list={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 53 locations, 7 error locations. UNSAFE Result, 1.4s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 485 SDtfs, 365 SDslu, 926 SDs, 0 SdLazy, 515 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=3, 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, 10 MinimizatonAttempts, 39 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 26229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-02 12:00:10,410 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:00:10,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:00:10,417 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:00:10,418 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:00:10,418 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:00:10,419 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:00:10,420 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:00:10,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:00:10,421 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:00:10,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:00:10,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:00:10,422 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:00:10,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:00:10,423 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:00:10,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:00:10,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:00:10,424 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:00:10,425 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:00:10,426 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:00:10,427 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:00:10,427 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:00:10,428 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:00:10,428 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:00:10,429 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:00:10,429 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:00:10,430 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:00:10,430 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:00:10,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:00:10,431 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:00:10,431 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:00:10,431 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:00:10,431 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:00:10,432 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:00:10,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:00:10,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:00:10,433 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 12:00:10,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:00:10,440 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:00:10,440 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:00:10,440 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:00:10,441 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:00:10,441 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:00:10,441 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:00:10,441 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:00:10,441 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:00:10,441 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:00:10,442 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 12:00:10,442 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 12:00:10,442 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:00:10,442 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:00:10,442 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 12:00:10,442 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:00:10,442 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:00:10,443 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:00:10,443 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 12:00:10,443 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 12:00:10,443 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 12:00:10,443 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:00:10,443 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 12:00:10,443 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 12:00:10,443 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:00:10,444 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 12:00:10,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:00:10,444 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:00:10,444 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:00:10,444 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:00:10,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:00:10,444 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:00:10,444 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:00:10,445 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 12:00:10,445 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:00:10,445 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 12:00:10,445 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_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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 -> db24912fd6b7f93a8f38fa3f07abfebcff2c46e9 [2018-12-02 12:00:10,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:00:10,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:00:10,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:00:10,472 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:00:10,473 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:00:10,473 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-02 12:00:10,509 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/data/7c5d5ec18/0a123d93a5804aaeb4606fcb90177c4e/FLAG7924c0442 [2018-12-02 12:00:10,940 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:00:10,940 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-02 12:00:10,947 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/data/7c5d5ec18/0a123d93a5804aaeb4606fcb90177c4e/FLAG7924c0442 [2018-12-02 12:00:10,955 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/bin-2019/utaipan/data/7c5d5ec18/0a123d93a5804aaeb4606fcb90177c4e [2018-12-02 12:00:10,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:00:10,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:00:10,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:00:10,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:00:10,961 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:00:10,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:00:10" (1/1) ... [2018-12-02 12:00:10,963 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 02.12 12:00:10, skipping insertion in model container [2018-12-02 12:00:10,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:00:10" (1/1) ... [2018-12-02 12:00:10,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:00:10,988 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:00:11,182 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:00:11,233 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:00:11,268 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:00:11,302 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:00:11,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11 WrapperNode [2018-12-02 12:00:11,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:00:11,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:00:11,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:00:11,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:00:11,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11" (1/1) ... [2018-12-02 12:00:11,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11" (1/1) ... [2018-12-02 12:00:11,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:00:11,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:00:11,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:00:11,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:00:11,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11" (1/1) ... [2018-12-02 12:00:11,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11" (1/1) ... [2018-12-02 12:00:11,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11" (1/1) ... [2018-12-02 12:00:11,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11" (1/1) ... [2018-12-02 12:00:11,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11" (1/1) ... [2018-12-02 12:00:11,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11" (1/1) ... [2018-12-02 12:00:11,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11" (1/1) ... [2018-12-02 12:00:11,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:00:11,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:00:11,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:00:11,341 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:00:11,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:00:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 12:00:11,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 12:00:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 12:00:11,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 12:00:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 12:00:11,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 12:00:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 12:00:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2018-12-02 12:00:11,373 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2018-12-02 12:00:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2018-12-02 12:00:11,373 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2018-12-02 12:00:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-12-02 12:00:11,374 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-12-02 12:00:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:00:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 12:00:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 12:00:11,374 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 12:00:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:00:11,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:00:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-12-02 12:00:11,374 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-12-02 12:00:11,545 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:00:11,545 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 12:00:11,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:00:11 BoogieIcfgContainer [2018-12-02 12:00:11,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:00:11,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:00:11,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:00:11,548 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:00:11,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:00:10" (1/3) ... [2018-12-02 12:00:11,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c0d4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:00:11, skipping insertion in model container [2018-12-02 12:00:11,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:00:11" (2/3) ... [2018-12-02 12:00:11,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c0d4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:00:11, skipping insertion in model container [2018-12-02 12:00:11,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:00:11" (3/3) ... [2018-12-02 12:00:11,550 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-02 12:00:11,555 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:00:11,559 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-02 12:00:11,568 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-02 12:00:11,581 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 12:00:11,582 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:00:11,582 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 12:00:11,582 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:00:11,582 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:00:11,582 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:00:11,582 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:00:11,583 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:00:11,583 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:00:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-02 12:00:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 12:00:11,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:11,596 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-02 12:00:11,598 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:00:11,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:11,601 INFO L82 PathProgramCache]: Analyzing trace with hash -387705796, now seen corresponding path program 1 times [2018-12-02 12:00:11,604 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:00:11,604 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:11,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:11,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:00:11,719 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-02 12:00:11,719 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:00:11,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:11,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:00:11,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:11,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:11,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:11,734 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2018-12-02 12:00:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:11,788 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-12-02 12:00:11,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:11,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 12:00:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:11,797 INFO L225 Difference]: With dead ends: 72 [2018-12-02 12:00:11,797 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 12:00:11,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-02 12:00:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 12:00:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2018-12-02 12:00:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 12:00:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-12-02 12:00:11,827 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2018-12-02 12:00:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:11,828 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-12-02 12:00:11,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-12-02 12:00:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 12:00:11,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:11,828 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-02 12:00:11,829 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:00:11,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:11,829 INFO L82 PathProgramCache]: Analyzing trace with hash -584219301, now seen corresponding path program 1 times [2018-12-02 12:00:11,829 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:00:11,829 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:11,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:11,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:00:11,902 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-02 12:00:11,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:11,917 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-02 12:00:11,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:11,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:11,934 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-02 12:00:11,936 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 12:00:11,961 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-02 12:00:11,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:11,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:11,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:12,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 12:00:12,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:12, output treesize:44 [2018-12-02 12:00:12,047 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-02 12:00:12,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:12,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:00:12,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-02 12:00:12,057 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-02 12:00:12,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:00:12,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:12,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:00:12,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:00:12,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:00:12,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:00:12,061 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-12-02 12:00:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:12,210 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-12-02 12:00:12,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:12,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 12:00:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:12,212 INFO L225 Difference]: With dead ends: 88 [2018-12-02 12:00:12,212 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 12:00:12,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 12:00:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-12-02 12:00:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 12:00:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-12-02 12:00:12,220 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 20 [2018-12-02 12:00:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:12,221 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-12-02 12:00:12,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:00:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-12-02 12:00:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 12:00:12,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:12,223 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-02 12:00:12,223 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:00:12,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:12,223 INFO L82 PathProgramCache]: Analyzing trace with hash -584219300, now seen corresponding path program 1 times [2018-12-02 12:00:12,224 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:00:12,224 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:12,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:12,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:00:12,291 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-02 12:00:12,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:12,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:00:12,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 12:00:12,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:00:12,331 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 2 xjuncts. [2018-12-02 12:00:12,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:24 [2018-12-02 12:00:12,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-02 12:00:12,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:12,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:00:12,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 12:00:12,376 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-02 12:00:12,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:00:12,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:12,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:00:12,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:00:12,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:00:12,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:00:12,379 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 4 states. [2018-12-02 12:00:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:12,493 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-12-02 12:00:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:00:12,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 12:00:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:12,495 INFO L225 Difference]: With dead ends: 106 [2018-12-02 12:00:12,495 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 12:00:12,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 12:00:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-12-02 12:00:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 12:00:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-12-02 12:00:12,501 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 20 [2018-12-02 12:00:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:12,501 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-12-02 12:00:12,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:00:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-12-02 12:00:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:00:12,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:12,502 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] [2018-12-02 12:00:12,502 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:00:12,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:12,502 INFO L82 PathProgramCache]: Analyzing trace with hash -400934782, now seen corresponding path program 1 times [2018-12-02 12:00:12,502 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:00:12,502 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:12,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:12,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:00:12,553 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-02 12:00:12,553 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:00:12,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:12,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:00:12,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:00:12,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:00:12,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:00:12,555 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 5 states. [2018-12-02 12:00:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:12,578 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-12-02 12:00:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:00:12,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 12:00:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:12,579 INFO L225 Difference]: With dead ends: 86 [2018-12-02 12:00:12,580 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 12:00:12,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-02 12:00:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 12:00:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-02 12:00:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 12:00:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-12-02 12:00:12,584 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 22 [2018-12-02 12:00:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:12,584 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-12-02 12:00:12,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:00:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-12-02 12:00:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 12:00:12,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:12,585 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-02 12:00:12,585 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:00:12,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash 455923737, now seen corresponding path program 1 times [2018-12-02 12:00:12,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:00:12,586 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:12,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:12,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:00:12,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:00:12,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:12,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:00:12,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 12:00:12,671 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-02 12:00:12,671 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:00:12,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:12,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:00:12,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:00:12,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:00:12,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:00:12,673 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 6 states. [2018-12-02 12:00:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:12,815 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-12-02 12:00:12,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:00:12,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-02 12:00:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:12,817 INFO L225 Difference]: With dead ends: 89 [2018-12-02 12:00:12,817 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 12:00:12,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:00:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 12:00:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-12-02 12:00:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 12:00:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-12-02 12:00:12,821 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 23 [2018-12-02 12:00:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:12,821 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-12-02 12:00:12,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:00:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-12-02 12:00:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 12:00:12,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:12,822 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-02 12:00:12,822 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:00:12,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash 162520730, now seen corresponding path program 1 times [2018-12-02 12:00:12,822 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:00:12,822 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:12,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:12,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:00:12,886 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-02 12:00:12,886 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:00:12,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:12,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:00:12,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:00:12,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:00:12,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:00:12,888 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-12-02 12:00:12,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:12,918 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-02 12:00:12,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:00:12,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-02 12:00:12,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:12,919 INFO L225 Difference]: With dead ends: 77 [2018-12-02 12:00:12,920 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 12:00:12,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:00:12,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 12:00:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-02 12:00:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 12:00:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-12-02 12:00:12,924 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 23 [2018-12-02 12:00:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:12,925 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-12-02 12:00:12,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:00:12,925 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-12-02 12:00:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:00:12,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:12,926 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] [2018-12-02 12:00:12,926 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:00:12,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:12,926 INFO L82 PathProgramCache]: Analyzing trace with hash -389142984, now seen corresponding path program 1 times [2018-12-02 12:00:12,926 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:00:12,926 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:12,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:12,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:00:12,989 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-02 12:00:12,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:13,000 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-02 12:00:13,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:13,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:13,012 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-02 12:00:13,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 12:00:13,036 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-02 12:00:13,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:13,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:13,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:13,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 12:00:13,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:12, output treesize:44 [2018-12-02 12:00:15,117 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-02 12:00:15,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:15,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:15,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 12:00:15,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:15,132 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-02 12:00:15,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-02 12:00:15,226 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-02 12:00:15,226 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:00:15,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:15,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:00:15,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:00:15,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:00:15,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2018-12-02 12:00:15,228 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-12-02 12:00:15,737 WARN L180 SmtUtils]: Spent 455.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 12:00:16,165 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 12:00:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:16,396 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-12-02 12:00:16,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:00:16,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-02 12:00:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:16,398 INFO L225 Difference]: With dead ends: 79 [2018-12-02 12:00:16,398 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 12:00:16,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=60, Invalid=125, Unknown=1, NotChecked=24, Total=210 [2018-12-02 12:00:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 12:00:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-12-02 12:00:16,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 12:00:16,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-12-02 12:00:16,401 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 28 [2018-12-02 12:00:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:16,401 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-12-02 12:00:16,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:00:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-12-02 12:00:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:00:16,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:16,402 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] [2018-12-02 12:00:16,402 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:00:16,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash -389142983, now seen corresponding path program 1 times [2018-12-02 12:00:16,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:00:16,403 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:16,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:16,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:00:16,470 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-02 12:00:16,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:16,481 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-02 12:00:16,485 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-02 12:00:16,486 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:16,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:16,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:16,517 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-02 12:00:16,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 12:00:16,546 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:16,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:16,613 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-02 12:00:16,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:16,625 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:00:16,626 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 12:00:16,640 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:00:16,671 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 6 xjuncts. [2018-12-02 12:00:16,671 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:25, output treesize:143 [2018-12-02 12:00:17,442 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:00:17,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:17,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-12-02 12:00:17,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:17,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:17,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:17,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-02 12:00:17,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:17,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:17,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-12-02 12:00:17,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:17,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:17,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:17,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-02 12:00:17,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 12:00:17,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:17,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:17,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:17,757 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 31 treesize of output 22 [2018-12-02 12:00:17,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:17,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:17,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:17,829 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 21 [2018-12-02 12:00:17,829 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:17,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:17,901 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:93, output treesize:40 [2018-12-02 12:00:17,984 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-02 12:00:17,984 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:00:17,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:17,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:00:17,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:00:17,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:00:17,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=39, Unknown=1, NotChecked=12, Total=72 [2018-12-02 12:00:17,987 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 9 states. [2018-12-02 12:00:18,303 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-02 12:00:22,684 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 36 [2018-12-02 12:00:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:23,725 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-12-02 12:00:23,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:00:23,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-02 12:00:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:23,725 INFO L225 Difference]: With dead ends: 76 [2018-12-02 12:00:23,725 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 12:00:23,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=59, Invalid=125, Unknown=2, NotChecked=24, Total=210 [2018-12-02 12:00:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 12:00:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-12-02 12:00:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 12:00:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-12-02 12:00:23,728 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 28 [2018-12-02 12:00:23,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:23,728 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-12-02 12:00:23,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:00:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-12-02 12:00:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:00:23,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:23,728 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] [2018-12-02 12:00:23,729 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:00:23,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:23,729 INFO L82 PathProgramCache]: Analyzing trace with hash -956170858, now seen corresponding path program 1 times [2018-12-02 12:00:23,729 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:00:23,729 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:23,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:23,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:00:23,790 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-02 12:00:23,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:23,800 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-02 12:00:23,803 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-02 12:00:23,803 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:23,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:23,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:23,826 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-02 12:00:23,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 12:00:23,843 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:23,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:23,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 12:00:23,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:12, output treesize:44 [2018-12-02 12:00:23,885 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-02 12:00:23,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:23,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:00:23,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-02 12:00:23,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:23,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-12-02 12:00:23,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:23,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:23,944 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 16 treesize of output 10 [2018-12-02 12:00:23,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:23,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 12:00:23,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-12-02 12:00:24,735 WARN L854 $PredicateComparison]: unable to prove that (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| probe1_6_~p~0.base)) (not (= probe1_6_~p~0.base (_ bv0 32))) (= |c_#valid| (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1))))) is different from true [2018-12-02 12:00:24,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:24,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:24,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 12:00:24,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:24,749 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-02 12:00:24,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:16 [2018-12-02 12:00:25,046 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-02 12:00:25,046 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:00:25,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:25,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 12:00:25,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:00:25,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:00:25,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=81, Unknown=1, NotChecked=18, Total=132 [2018-12-02 12:00:25,048 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 12 states. [2018-12-02 12:00:34,430 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-12-02 12:00:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:00:38,603 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-02 12:00:38,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 12:00:38,604 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-02 12:00:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:00:38,604 INFO L225 Difference]: With dead ends: 57 [2018-12-02 12:00:38,604 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 12:00:38,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2018-12-02 12:00:38,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 12:00:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-02 12:00:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 12:00:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-12-02 12:00:38,607 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 28 [2018-12-02 12:00:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:00:38,607 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-12-02 12:00:38,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:00:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-12-02 12:00:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:00:38,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:00:38,608 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] [2018-12-02 12:00:38,608 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:00:38,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:00:38,608 INFO L82 PathProgramCache]: Analyzing trace with hash -956170857, now seen corresponding path program 1 times [2018-12-02 12:00:38,608 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:00:38,608 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:00:38,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:00:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:00:38,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:00:38,680 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-02 12:00:38,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:38,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-02 12:00:38,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:38,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:38,708 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-02 12:00:38,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 12:00:38,744 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-02 12:00:38,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:38,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:38,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:38,843 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-02 12:00:38,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:38,854 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:00:38,854 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 12:00:38,869 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:00:38,900 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 6 xjuncts. [2018-12-02 12:00:38,900 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:25, output treesize:143 [2018-12-02 12:00:38,975 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 25 treesize of output 20 [2018-12-02 12:00:38,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:39,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:39,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:39,011 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 20 treesize of output 14 [2018-12-02 12:00:39,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:39,054 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-02 12:00:39,055 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:39,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:00:39,063 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:69, output treesize:10 [2018-12-02 12:00:40,552 WARN L180 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 12:00:40,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:00:40,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:40,565 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-02 12:00:40,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:40,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:00:40,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:3 [2018-12-02 12:00:41,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 47 [2018-12-02 12:00:41,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 12:00:41,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,424 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 30 treesize of output 33 [2018-12-02 12:00:41,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:41,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,512 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 30 treesize of output 33 [2018-12-02 12:00:41,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:41,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,582 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 29 treesize of output 23 [2018-12-02 12:00:41,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:41,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,585 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 21 [2018-12-02 12:00:41,585 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:41,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,643 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 29 treesize of output 22 [2018-12-02 12:00:41,644 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:41,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:00:41,704 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 29 treesize of output 21 [2018-12-02 12:00:41,705 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 12:00:41,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 12:00:41,764 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:91, output treesize:40 [2018-12-02 12:00:43,787 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-02 12:00:43,787 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:00:43,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:00:43,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:00:43,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:00:43,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:00:43,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=23, Unknown=3, NotChecked=0, Total=42 [2018-12-02 12:00:43,789 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 7 states. [2018-12-02 12:00:51,779 WARN L180 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-02 12:00:57,373 WARN L180 SmtUtils]: Spent 844.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-02 12:01:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:01:04,785 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-12-02 12:01:04,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:01:04,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-02 12:01:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:01:04,786 INFO L225 Difference]: With dead ends: 53 [2018-12-02 12:01:04,786 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 12:01:04,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=40, Invalid=61, Unknown=9, NotChecked=0, Total=110 [2018-12-02 12:01:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 12:01:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 12:01:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 12:01:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-02 12:01:04,787 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 28 [2018-12-02 12:01:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:01:04,787 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-02 12:01:04,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:01:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-02 12:01:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 12:01:04,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:01:04,788 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] [2018-12-02 12:01:04,788 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:01:04,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:01:04,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1235066613, now seen corresponding path program 1 times [2018-12-02 12:01:04,788 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:01:04,789 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:01:04,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:01:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:01:04,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:01:04,840 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-02 12:01:04,840 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:01:04,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:01:04,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:01:04,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:01:04,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:01:04,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:01:04,843 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 5 states. [2018-12-02 12:01:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:01:04,846 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-12-02 12:01:04,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:01:04,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-02 12:01:04,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:01:04,847 INFO L225 Difference]: With dead ends: 42 [2018-12-02 12:01:04,847 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 12:01:04,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-02 12:01:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 12:01:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 12:01:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 12:01:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-12-02 12:01:04,849 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 37 [2018-12-02 12:01:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:01:04,849 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-12-02 12:01:04,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:01:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-12-02 12:01:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 12:01:04,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:01:04,850 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, 1, 1] [2018-12-02 12:01:04,850 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 12:01:04,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:01:04,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1878309586, now seen corresponding path program 1 times [2018-12-02 12:01:04,850 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:01:04,850 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06b1de02-1074-44d2-be0d-e0dbd1cb5a13/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-02 12:01:04,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:01:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:01:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:01:05,038 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:01:05,052 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 12:01:05,059 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-02 12:01:05,060 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-02 12:01:05,060 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-02 12:01:05,060 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-02 12:01:05,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:01:05 BoogieIcfgContainer [2018-12-02 12:01:05,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:01:05,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:01:05,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:01:05,067 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:01:05,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:00:11" (3/4) ... [2018-12-02 12:01:05,070 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 12:01:05,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:01:05,071 INFO L168 Benchmark]: Toolchain (without parser) took 54113.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 281.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 114.2 MB. Max. memory is 11.5 GB. [2018-12-02 12:01:05,071 INFO L168 Benchmark]: CDTParser took 0.13 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-02 12:01:05,071 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-12-02 12:01:05,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:01:05,072 INFO L168 Benchmark]: Boogie Preprocessor took 16.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:01:05,072 INFO L168 Benchmark]: RCFGBuilder took 204.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:01:05,072 INFO L168 Benchmark]: TraceAbstraction took 53520.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.5 MB). Peak memory consumption was 114.8 MB. Max. memory is 11.5 GB. [2018-12-02 12:01:05,073 INFO L168 Benchmark]: Witness Printer took 2.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:01:05,074 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 204.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53520.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.5 MB). Peak memory consumption was 114.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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: 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~~A?p~*VOID# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1476]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1476. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L1465] struct A a6; VAL [\old(a6)=null, \old(a6)=null, \old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, a6={3:0}, ldv_global_msg_list={1:0}] [L1477] CALL entry_point() VAL [a6={3:0}, ldv_global_msg_list={1:0}] [L1469] CALL, EXPR probe1_6(&a6) VAL [a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}] [L1443] int ret = - -3; VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={3:0}, ldv_global_msg_list={1:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={2:0}, a6={3:0}, ldv_global_msg_list={1:0}, malloc(size)={2:0}, size=4] [L1444] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(int))={2:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=3] [L1447] CALL, EXPR f6() VAL [a6={3:0}, ldv_global_msg_list={1:0}] [L1435] return __VERIFIER_nondet_int(); [L1447] RET, EXPR f6() VAL [a={3:0}, a={3:0}, a6={3:0}, f6()=0, ldv_global_msg_list={1:0}, p={2:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1450] CALL, EXPR g6() VAL [a6={3:0}, ldv_global_msg_list={1:0}] [L1439] return __VERIFIER_nondet_int(); [L1450] RET, EXPR g6() VAL [a={3:0}, a={3:0}, a6={3:0}, g6()=0, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1453] a->p = p VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1454] return 0; VAL [\result=0, a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1469] RET, EXPR probe1_6(&a6) VAL [a6={3:0}, ldv_global_msg_list={1:0}, probe1_6(&a6)=0] [L1469] int ret = probe1_6(&a6); [L1470] COND TRUE ret==0 VAL [a6={3:0}, ldv_global_msg_list={1:0}, ret=0] [L1471] FCALL disconnect_2_6(&a6) VAL [a6={3:0}, ldv_global_msg_list={1:0}, ret=0] [L1473] a6.p = 0 VAL [a6={3:0}, ldv_global_msg_list={1:0}, ret=0] [L1477] RET entry_point() VAL [a6={3:0}, ldv_global_msg_list={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 53 locations, 7 error locations. UNSAFE Result, 53.4s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 42.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 568 SDtfs, 545 SDslu, 1147 SDs, 0 SdLazy, 761 SolverSat, 215 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 21.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 202 SyntacticMatches, 14 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 28.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=3, 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, 11 MinimizatonAttempts, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 266 ConstructedInterpolants, 47 QuantifiedInterpolants, 57118 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1177 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...