./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_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_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/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 95dd23c3faf110dda910911db52d9ffd09e9e4b3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/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 95dd23c3faf110dda910911db52d9ffd09e9e4b3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 16:21:59,507 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:21:59,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:21:59,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:21:59,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:21:59,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:21:59,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:21:59,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:21:59,517 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:21:59,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:21:59,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:21:59,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:21:59,518 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:21:59,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:21:59,519 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:21:59,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:21:59,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:21:59,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:21:59,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:21:59,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:21:59,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:21:59,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:21:59,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:21:59,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:21:59,525 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:21:59,526 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:21:59,526 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:21:59,527 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:21:59,527 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:21:59,528 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:21:59,528 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:21:59,528 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:21:59,528 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:21:59,528 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:21:59,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:21:59,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:21:59,529 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 16:21:59,537 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:21:59,537 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:21:59,537 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:21:59,538 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:21:59,538 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:21:59,538 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:21:59,538 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:21:59,538 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:21:59,538 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:21:59,538 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:21:59,538 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:21:59,538 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:21:59,538 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:21:59,539 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:21:59,539 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:21:59,539 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:21:59,539 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:21:59,539 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 16:21:59,539 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:21:59,539 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:21:59,539 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:21:59,540 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 16:21:59,540 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 16:21:59,540 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 16:21:59,540 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:21:59,540 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:21:59,540 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:21:59,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:21:59,540 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:21:59,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:21:59,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:21:59,541 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:21:59,541 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:21:59,541 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:21:59,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:21:59,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:21:59,541 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_e0abc629-6bb7-49de-8f06-759e37d9b901/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 -> 95dd23c3faf110dda910911db52d9ffd09e9e4b3 [2018-12-09 16:21:59,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:21:59,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:21:59,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:21:59,571 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:21:59,572 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:21:59,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-09 16:21:59,612 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/data/c98223151/7a985b7112174dd594eee87282577047/FLAG3eb2d8704 [2018-12-09 16:22:00,062 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:22:00,063 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-09 16:22:00,070 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/data/c98223151/7a985b7112174dd594eee87282577047/FLAG3eb2d8704 [2018-12-09 16:22:00,078 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/data/c98223151/7a985b7112174dd594eee87282577047 [2018-12-09 16:22:00,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:22:00,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:22:00,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:22:00,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:22:00,083 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:22:00,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:22:00" (1/1) ... [2018-12-09 16:22:00,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3ca699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00, skipping insertion in model container [2018-12-09 16:22:00,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:22:00" (1/1) ... [2018-12-09 16:22:00,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:22:00,112 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:22:00,334 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:22:00,344 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:22:00,379 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:22:00,410 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:22:00,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00 WrapperNode [2018-12-09 16:22:00,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:22:00,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:22:00,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:22:00,411 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:22:00,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00" (1/1) ... [2018-12-09 16:22:00,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00" (1/1) ... [2018-12-09 16:22:00,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:22:00,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:22:00,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:22:00,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:22:00,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00" (1/1) ... [2018-12-09 16:22:00,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00" (1/1) ... [2018-12-09 16:22:00,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00" (1/1) ... [2018-12-09 16:22:00,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00" (1/1) ... [2018-12-09 16:22:00,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00" (1/1) ... [2018-12-09 16:22:00,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00" (1/1) ... [2018-12-09 16:22:00,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00" (1/1) ... [2018-12-09 16:22:00,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:22:00,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:22:00,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:22:00,448 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:22:00,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:22:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:22:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 16:22:00,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 16:22:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:22:00,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:22:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:22:00,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:22:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 16:22:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 16:22:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 16:22:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 16:22:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:22:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:22:00,599 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:22:00,599 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 16:22:00,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:22:00 BoogieIcfgContainer [2018-12-09 16:22:00,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:22:00,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:22:00,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:22:00,602 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:22:00,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:22:00" (1/3) ... [2018-12-09 16:22:00,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af276ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:22:00, skipping insertion in model container [2018-12-09 16:22:00,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:22:00" (2/3) ... [2018-12-09 16:22:00,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af276ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:22:00, skipping insertion in model container [2018-12-09 16:22:00,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:22:00" (3/3) ... [2018-12-09 16:22:00,604 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-09 16:22:00,610 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:22:00,615 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 16:22:00,624 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 16:22:00,640 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:22:00,640 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 16:22:00,640 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:22:00,640 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:22:00,640 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:22:00,640 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:22:00,640 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:22:00,640 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:22:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-09 16:22:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 16:22:00,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:00,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:00,656 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:00,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:00,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1493808756, now seen corresponding path program 1 times [2018-12-09 16:22:00,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:00,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:00,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:00,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:00,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:22:00,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:00,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:22:00,777 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:00,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:22:00,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:22:00,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:22:00,789 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-12-09 16:22:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:00,828 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-09 16:22:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:22:00,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-09 16:22:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:00,835 INFO L225 Difference]: With dead ends: 41 [2018-12-09 16:22:00,835 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 16:22:00,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:22:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 16:22:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-12-09 16:22:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 16:22:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-09 16:22:00,861 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2018-12-09 16:22:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:00,861 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-09 16:22:00,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:22:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-09 16:22:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 16:22:00,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:00,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:00,862 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:00,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:00,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1058348205, now seen corresponding path program 1 times [2018-12-09 16:22:00,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:00,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:00,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:00,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:00,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:22:00,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:00,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:22:00,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:00,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:22:00,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:22:00,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:22:00,891 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-12-09 16:22:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:00,919 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-12-09 16:22:00,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:22:00,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 16:22:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:00,920 INFO L225 Difference]: With dead ends: 39 [2018-12-09 16:22:00,920 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 16:22:00,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:22:00,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 16:22:00,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-09 16:22:00,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 16:22:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-12-09 16:22:00,924 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2018-12-09 16:22:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:00,924 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-12-09 16:22:00,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:22:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-12-09 16:22:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 16:22:00,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:00,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:00,925 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:00,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:00,925 INFO L82 PathProgramCache]: Analyzing trace with hash -936037343, now seen corresponding path program 1 times [2018-12-09 16:22:00,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:00,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:00,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:22:00,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:22:00,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:22:00,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:00,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:22:00,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:22:00,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:22:00,966 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-12-09 16:22:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:00,987 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-12-09 16:22:00,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:22:00,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 16:22:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:00,988 INFO L225 Difference]: With dead ends: 46 [2018-12-09 16:22:00,988 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 16:22:00,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:22:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 16:22:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-12-09 16:22:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 16:22:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-09 16:22:00,992 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 18 [2018-12-09 16:22:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:00,992 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-09 16:22:00,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:22:00,993 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-12-09 16:22:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 16:22:00,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:00,993 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:00,993 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:00,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:00,994 INFO L82 PathProgramCache]: Analyzing trace with hash -489509575, now seen corresponding path program 1 times [2018-12-09 16:22:00,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:00,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:00,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:00,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:00,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:22:01,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:01,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:22:01,067 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-09 16:22:01,068 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [14], [16], [20], [28], [30], [32], [40], [41], [42], [44], [46], [47], [48], [49] [2018-12-09 16:22:01,088 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:22:01,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:22:01,179 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:22:01,180 INFO L272 AbstractInterpreter]: Visited 19 different actions 22 times. Never merged. Never widened. Performed 173 root evaluator evaluations with a maximum evaluation depth of 3. Performed 173 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 26 variables. [2018-12-09 16:22:01,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:01,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:22:01,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:01,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:22:01,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:01,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:22:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:01,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:22:01,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:22:01,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:01,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:01,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:22:01,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:01,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:01,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 16:22:01,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:01,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:22:01,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-09 16:22:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:22:01,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:22:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:22:02,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:22:02,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2018-12-09 16:22:02,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:22:02,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:22:02,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:22:02,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=144, Unknown=1, NotChecked=0, Total=182 [2018-12-09 16:22:02,161 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 9 states. [2018-12-09 16:22:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:02,345 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-12-09 16:22:02,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 16:22:02,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-09 16:22:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:02,347 INFO L225 Difference]: With dead ends: 63 [2018-12-09 16:22:02,347 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 16:22:02,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=263, Unknown=1, NotChecked=0, Total=342 [2018-12-09 16:22:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 16:22:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2018-12-09 16:22:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 16:22:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2018-12-09 16:22:02,351 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 22 [2018-12-09 16:22:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:02,351 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-12-09 16:22:02,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:22:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2018-12-09 16:22:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 16:22:02,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:02,352 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:02,352 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:02,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash -489509574, now seen corresponding path program 1 times [2018-12-09 16:22:02,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:02,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:02,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:02,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:02,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:22:02,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:02,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:22:02,465 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-09 16:22:02,466 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [14], [16], [20], [28], [30], [33], [40], [41], [42], [44], [46], [47], [48], [49] [2018-12-09 16:22:02,467 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:22:02,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:22:02,499 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:22:02,500 INFO L272 AbstractInterpreter]: Visited 19 different actions 22 times. Never merged. Never widened. Performed 174 root evaluator evaluations with a maximum evaluation depth of 4. Performed 174 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 26 variables. [2018-12-09 16:22:02,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:02,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:22:02,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:02,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:22:02,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:02,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:22:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:02,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:22:02,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:22:02,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:02,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:22:02,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:02,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:02,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-09 16:22:02,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:02,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:02,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:22:02,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:02,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:22:02,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:02,608 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-09 16:22:02,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 16:22:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:22:02,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:22:02,677 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-12-09 16:22:14,970 WARN L180 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 72 DAG size of output: 30 [2018-12-09 16:22:14,977 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-09 16:22:15,137 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 11 treesize of output 15 [2018-12-09 16:22:15,145 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 16:22:15,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:15,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-09 16:22:15,147 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:15,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:15,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-09 16:22:15,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:15,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:15,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:26, output treesize:5 [2018-12-09 16:22:17,250 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 34 [2018-12-09 16:22:17,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-09 16:22:17,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:17,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-12-09 16:22:17,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-09 16:22:17,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:17,316 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 16:22:17,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:17,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:17,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:22:17,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:31, output treesize:14 [2018-12-09 16:22:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:22:17,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:22:17,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-09 16:22:17,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:22:17,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 16:22:17,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 16:22:17,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=293, Unknown=2, NotChecked=0, Total=342 [2018-12-09 16:22:17,377 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 11 states. [2018-12-09 16:22:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:17,647 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-12-09 16:22:17,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 16:22:17,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-12-09 16:22:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:17,648 INFO L225 Difference]: With dead ends: 60 [2018-12-09 16:22:17,648 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 16:22:17,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=116, Invalid=584, Unknown=2, NotChecked=0, Total=702 [2018-12-09 16:22:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 16:22:17,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2018-12-09 16:22:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 16:22:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2018-12-09 16:22:17,652 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 22 [2018-12-09 16:22:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:17,652 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2018-12-09 16:22:17,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 16:22:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2018-12-09 16:22:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 16:22:17,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:17,653 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:17,653 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:17,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:17,653 INFO L82 PathProgramCache]: Analyzing trace with hash -782912582, now seen corresponding path program 1 times [2018-12-09 16:22:17,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:17,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:17,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:17,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:17,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:22:17,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:17,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:22:17,679 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-09 16:22:17,679 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [14], [16], [20], [28], [30], [32], [40], [41], [42], [44], [46], [47], [48], [49] [2018-12-09 16:22:17,679 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:22:17,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:22:17,711 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:22:17,711 INFO L272 AbstractInterpreter]: Visited 20 different actions 28 times. Merged at 2 different actions 4 times. Never widened. Performed 193 root evaluator evaluations with a maximum evaluation depth of 3. Performed 193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 26 variables. [2018-12-09 16:22:17,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:17,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:22:17,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:17,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:22:17,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:17,720 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:22:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:17,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:22:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:22:17,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:22:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:22:17,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:22:17,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 5 [2018-12-09 16:22:17,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:22:17,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:22:17,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:22:17,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:22:17,786 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand 5 states. [2018-12-09 16:22:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:17,794 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-09 16:22:17,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:22:17,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 16:22:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:17,794 INFO L225 Difference]: With dead ends: 32 [2018-12-09 16:22:17,794 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 16:22:17,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:22:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 16:22:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 16:22:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 16:22:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-09 16:22:17,796 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2018-12-09 16:22:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:17,797 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-09 16:22:17,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:22:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-09 16:22:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 16:22:17,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:17,797 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:17,797 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:17,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:17,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1470466568, now seen corresponding path program 1 times [2018-12-09 16:22:17,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:17,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:17,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:17,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:17,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:22:17,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:17,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:22:17,826 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-09 16:22:17,826 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [13], [14], [16], [20], [26], [28], [30], [31], [35], [39], [40], [41], [42], [44], [45], [46], [47], [48], [49] [2018-12-09 16:22:17,827 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:22:17,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:22:17,877 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:22:17,877 INFO L272 AbstractInterpreter]: Visited 24 different actions 59 times. Merged at 7 different actions 17 times. Never widened. Performed 510 root evaluator evaluations with a maximum evaluation depth of 4. Performed 510 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-12-09 16:22:17,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:17,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:22:17,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:17,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:22:17,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:17,890 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:22:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:17,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:22:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:22:17,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:22:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:22:17,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:22:17,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-09 16:22:17,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:22:17,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:22:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:22:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:22:17,968 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 7 states. [2018-12-09 16:22:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:17,986 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-09 16:22:17,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:22:17,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-09 16:22:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:17,987 INFO L225 Difference]: With dead ends: 37 [2018-12-09 16:22:17,987 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 16:22:17,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:22:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 16:22:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-12-09 16:22:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 16:22:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-09 16:22:17,989 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 27 [2018-12-09 16:22:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:17,990 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-09 16:22:17,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:22:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-09 16:22:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 16:22:17,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:17,990 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:17,990 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:17,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:17,990 INFO L82 PathProgramCache]: Analyzing trace with hash -934990959, now seen corresponding path program 1 times [2018-12-09 16:22:17,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:17,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:17,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:17,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:17,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:22:18,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:18,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:22:18,130 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-09 16:22:18,130 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [14], [16], [20], [28], [30], [31], [33], [35], [40], [41], [42], [44], [46], [47], [48], [49] [2018-12-09 16:22:18,131 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:22:18,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:22:18,171 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:22:18,171 INFO L272 AbstractInterpreter]: Visited 21 different actions 54 times. Merged at 6 different actions 18 times. Never widened. Performed 519 root evaluator evaluations with a maximum evaluation depth of 4. Performed 519 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-09 16:22:18,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:18,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:22:18,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:18,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:22:18,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:18,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:22:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:18,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:22:18,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:22:18,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:18,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:22:18,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:18,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:18,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-09 16:22:18,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:18,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:22:18,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:18,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:18,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:18,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:22:18,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:18,274 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-09 16:22:18,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 16:22:18,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:18,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:22:18,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:18,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:18,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:18,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:22:18,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:18,312 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-09 16:22:18,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 16:22:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:22:18,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:22:20,407 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-09 16:22:20,413 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-09 16:22:25,026 WARN L180 SmtUtils]: Spent 4.53 s on a formula simplification. DAG size of input: 68 DAG size of output: 25 [2018-12-09 16:22:27,104 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:22:27,105 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:22:27,105 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 34 treesize of output 25 [2018-12-09 16:22:27,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:27,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 16:22:27,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:64, output treesize:25 [2018-12-09 16:22:29,185 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~array~0.offset_BEFORE_CALL_6 Int) (|v_ldv_malloc_#t~malloc12.base_35| Int) (v_entry_point_~i~0_BEFORE_CALL_8 Int) (v_entry_point_~array~0.base_BEFORE_CALL_8 Int) (v_ldv_malloc_~size_38 Int)) (let ((.cse0 (* 4 v_entry_point_~i~0_BEFORE_CALL_8))) (or (<= (+ v_entry_point_~array~0.offset_BEFORE_CALL_6 .cse0 8) (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_35| v_ldv_malloc_~size_38) v_entry_point_~array~0.base_BEFORE_CALL_8)) (exists ((v_prenex_27 Int) (v_prenex_28 Int) (|v_ldv_malloc_#t~malloc12.base_39| Int) (v_ldv_malloc_~size_42 Int)) (and (not (= v_prenex_27 v_entry_point_~array~0.base_BEFORE_CALL_8)) (< (select (store (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_39| v_ldv_malloc_~size_42) v_prenex_27 v_prenex_28) v_entry_point_~array~0.base_BEFORE_CALL_8) (+ v_entry_point_~array~0.offset_BEFORE_CALL_6 (* 4 v_entry_point_~i~0_BEFORE_CALL_8) 8)) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_39|) 0))) (= |v_ldv_malloc_#t~malloc12.base_35| v_entry_point_~array~0.base_BEFORE_CALL_8) (< (+ v_entry_point_~array~0.offset_BEFORE_CALL_6 .cse0) 0)))) is different from false [2018-12-09 16:22:44,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-12-09 16:22:44,270 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:22:44,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-09 16:22:44,282 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 18 treesize of output 7 [2018-12-09 16:22:44,282 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:44,282 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 16:22:44,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:44,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:44,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:44,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-09 16:22:44,294 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:44,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:44,298 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:32, output treesize:5 [2018-12-09 16:22:46,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-09 16:22:46,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:46,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-12-09 16:22:46,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-09 16:22:46,386 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 16:22:46,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:46,388 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 18 treesize of output 7 [2018-12-09 16:22:46,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:46,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:46,393 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:46,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:22:46,399 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:37, output treesize:14 [2018-12-09 16:22:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 4 not checked. [2018-12-09 16:22:46,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:22:46,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 27 [2018-12-09 16:22:46,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:22:46,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 16:22:46,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 16:22:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=607, Unknown=10, NotChecked=50, Total=756 [2018-12-09 16:22:46,448 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 15 states. [2018-12-09 16:22:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:52,348 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-12-09 16:22:52,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 16:22:52,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2018-12-09 16:22:52,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:52,349 INFO L225 Difference]: With dead ends: 56 [2018-12-09 16:22:52,350 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 16:22:52,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=206, Invalid=1192, Unknown=12, NotChecked=72, Total=1482 [2018-12-09 16:22:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 16:22:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 35. [2018-12-09 16:22:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 16:22:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-12-09 16:22:52,353 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 31 [2018-12-09 16:22:52,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:52,353 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-09 16:22:52,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 16:22:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-12-09 16:22:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 16:22:52,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:52,354 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:52,354 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:52,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:52,354 INFO L82 PathProgramCache]: Analyzing trace with hash -247704063, now seen corresponding path program 2 times [2018-12-09 16:22:52,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:52,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:52,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:22:52,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:52,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 16:22:52,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:52,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:22:52,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:22:52,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:22:52,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:52,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:22:52,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:22:52,394 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:22:52,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 16:22:52,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:22:52,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:22:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 16:22:52,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:22:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 16:22:52,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:22:52,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-12-09 16:22:52,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:22:52,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:22:52,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:22:52,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-12-09 16:22:52,488 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 9 states. [2018-12-09 16:22:52,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:52,517 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-12-09 16:22:52,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:22:52,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-09 16:22:52,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:52,518 INFO L225 Difference]: With dead ends: 42 [2018-12-09 16:22:52,518 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 16:22:52,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-12-09 16:22:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 16:22:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-12-09 16:22:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 16:22:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-12-09 16:22:52,520 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 36 [2018-12-09 16:22:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:52,520 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-12-09 16:22:52,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:22:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-12-09 16:22:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 16:22:52,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:52,521 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:22:52,521 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:22:52,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:52,521 INFO L82 PathProgramCache]: Analyzing trace with hash 230022938, now seen corresponding path program 2 times [2018-12-09 16:22:52,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:52,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:52,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:22:52,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:52,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:22:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 16:22:52,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:52,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:22:52,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:22:52,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:22:52,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:22:52,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:22:52,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:22:52,704 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:22:52,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 16:22:52,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:22:52,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:22:52,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:22:52,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:52,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:22:52,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:52,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:22:52,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-09 16:22:52,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:52,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:22:52,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:52,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:52,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:52,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:22:52,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:52,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:22:52,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2018-12-09 16:22:52,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:52,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:52,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:22:52,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:52,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:22:52,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:52,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:22:52,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2018-12-09 16:22:52,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:52,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:22:52,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:22:52,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:52,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:22:52,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:22:53,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:22:53,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:24 [2018-12-09 16:22:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 16:22:53,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:22:53,096 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-09 16:23:09,748 WARN L180 SmtUtils]: Spent 12.14 s on a formula simplification. DAG size of input: 68 DAG size of output: 30 [2018-12-09 16:23:09,751 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-09 16:23:09,925 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:23:09,925 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:23:09,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-12-09 16:23:09,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:09,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 16:23:09,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:64, output treesize:25 [2018-12-09 16:23:12,033 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~i~0_BEFORE_CALL_17 Int) (v_entry_point_~array~0.offset_BEFORE_CALL_11 Int) (v_entry_point_~array~0.base_BEFORE_CALL_13 Int)) (or (exists ((|v_ldv_malloc_#t~malloc12.base_65| Int) (v_ldv_malloc_~size_68 Int) (|v_ldv_malloc_#t~malloc12.base_69| Int) (v_ldv_malloc_~size_72 Int)) (and (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_69|) 0) (< (select (store (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_69| v_ldv_malloc_~size_72) |v_ldv_malloc_#t~malloc12.base_65| v_ldv_malloc_~size_68) v_entry_point_~array~0.base_BEFORE_CALL_13) (+ (* 4 v_entry_point_~i~0_BEFORE_CALL_17) v_entry_point_~array~0.offset_BEFORE_CALL_11 8)) (not (= |v_ldv_malloc_#t~malloc12.base_65| v_entry_point_~array~0.base_BEFORE_CALL_13)))) (< (+ (* 4 v_entry_point_~i~0_BEFORE_CALL_17) v_entry_point_~array~0.offset_BEFORE_CALL_11) 0) (forall ((v_prenex_43 Int) (v_prenex_42 Int)) (or (= v_prenex_42 v_entry_point_~array~0.base_BEFORE_CALL_13) (<= (+ (* 4 v_entry_point_~i~0_BEFORE_CALL_17) v_entry_point_~array~0.offset_BEFORE_CALL_11 8) (select (store |c_#length| v_prenex_42 v_prenex_43) v_entry_point_~array~0.base_BEFORE_CALL_13)))))) is different from false [2018-12-09 16:23:47,964 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:23:47,964 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:23:47,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 16:23:47,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:47,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-09 16:23:47,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:35 [2018-12-09 16:23:59,508 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 16:24:01,514 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~i~0_BEFORE_CALL_18 Int) (v_entry_point_~array~0.offset_BEFORE_CALL_12 Int) (v_entry_point_~array~0.base_BEFORE_CALL_14 Int)) (or (forall ((v_prenex_48 Int) (v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (let ((.cse0 (* 4 v_prenex_44))) (or (<= (+ .cse0 v_entry_point_~array~0.offset_BEFORE_CALL_12 8) (select (store (store |c_#length| v_prenex_47 v_prenex_48) v_prenex_45 v_prenex_46) v_entry_point_~array~0.base_BEFORE_CALL_14)) (< (+ .cse0 v_entry_point_~array~0.offset_BEFORE_CALL_12) 0) (= v_prenex_45 v_entry_point_~array~0.base_BEFORE_CALL_14) (= v_prenex_47 v_entry_point_~array~0.base_BEFORE_CALL_14) (< (+ v_entry_point_~i~0_BEFORE_CALL_18 1) v_prenex_44)))) (exists ((v_ldv_malloc_~size_76 Int) (|v_ldv_malloc_#t~malloc12.base_65| Int) (v_ldv_malloc_~size_68 Int) (|v_ldv_malloc_#t~malloc12.base_69| Int) (v_ldv_malloc_~size_72 Int) (v_entry_point_~i~0_34 Int) (|v_ldv_malloc_#t~malloc12.base_73| Int)) (let ((.cse1 (* 4 v_entry_point_~i~0_34))) (and (< (select (store (store (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_73| v_ldv_malloc_~size_76) |v_ldv_malloc_#t~malloc12.base_69| v_ldv_malloc_~size_72) |v_ldv_malloc_#t~malloc12.base_65| v_ldv_malloc_~size_68) v_entry_point_~array~0.base_BEFORE_CALL_14) (+ .cse1 v_entry_point_~array~0.offset_BEFORE_CALL_12 8)) (<= 0 (+ .cse1 v_entry_point_~array~0.offset_BEFORE_CALL_12)) (<= v_entry_point_~i~0_34 (+ v_entry_point_~i~0_BEFORE_CALL_18 1)) (not (= |v_ldv_malloc_#t~malloc12.base_65| v_entry_point_~array~0.base_BEFORE_CALL_14)) (not (= |v_ldv_malloc_#t~malloc12.base_69| v_entry_point_~array~0.base_BEFORE_CALL_14)) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_73|) 0)))))) is different from false [2018-12-09 16:24:03,527 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_prenex_48 Int) (v_entry_point_~i~0_BEFORE_CALL_18 Int) (v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_47 Int) (v_prenex_46 Int) (v_entry_point_~array~0.offset_BEFORE_CALL_12 Int) (v_entry_point_~array~0.base_BEFORE_CALL_14 Int)) (let ((.cse0 (* 4 v_prenex_44))) (or (<= (+ .cse0 v_entry_point_~array~0.offset_BEFORE_CALL_12 8) (select (store (store |c_#length| v_prenex_47 v_prenex_48) v_prenex_45 v_prenex_46) v_entry_point_~array~0.base_BEFORE_CALL_14)) (< (+ .cse0 v_entry_point_~array~0.offset_BEFORE_CALL_12) 0) (= v_prenex_45 v_entry_point_~array~0.base_BEFORE_CALL_14) (= v_prenex_47 v_entry_point_~array~0.base_BEFORE_CALL_14) (exists ((v_ldv_malloc_~size_76 Int) (|v_ldv_malloc_#t~malloc12.base_65| Int) (v_ldv_malloc_~size_68 Int) (|v_ldv_malloc_#t~malloc12.base_69| Int) (v_ldv_malloc_~size_72 Int) (v_entry_point_~i~0_34 Int) (|v_ldv_malloc_#t~malloc12.base_73| Int)) (let ((.cse1 (* 4 v_entry_point_~i~0_34))) (and (< (select (store (store (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_73| v_ldv_malloc_~size_76) |v_ldv_malloc_#t~malloc12.base_69| v_ldv_malloc_~size_72) |v_ldv_malloc_#t~malloc12.base_65| v_ldv_malloc_~size_68) v_entry_point_~array~0.base_BEFORE_CALL_14) (+ .cse1 v_entry_point_~array~0.offset_BEFORE_CALL_12 8)) (<= 0 (+ .cse1 v_entry_point_~array~0.offset_BEFORE_CALL_12)) (<= v_entry_point_~i~0_34 (+ v_entry_point_~i~0_BEFORE_CALL_18 1)) (not (= |v_ldv_malloc_#t~malloc12.base_65| v_entry_point_~array~0.base_BEFORE_CALL_14)) (not (= |v_ldv_malloc_#t~malloc12.base_69| v_entry_point_~array~0.base_BEFORE_CALL_14)) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_73|) 0)))) (< (+ v_entry_point_~i~0_BEFORE_CALL_18 1) v_prenex_44)))) is different from false [2018-12-09 16:24:34,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-09 16:24:34,446 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:24:34,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-12-09 16:24:34,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2018-12-09 16:24:34,504 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 16:24:34,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:34,507 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 36 treesize of output 25 [2018-12-09 16:24:34,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:34,509 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 21 [2018-12-09 16:24:34,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:34,539 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 1 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 16:24:34,539 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 16:24:34,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:34,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:34,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:34,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-09 16:24:34,571 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:34,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:24:34,578 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:50, output treesize:18 [2018-12-09 16:24:40,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-09 16:24:40,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:40,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-09 16:24:40,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-12-09 16:24:40,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2018-12-09 16:24:40,870 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 36 treesize of output 25 [2018-12-09 16:24:40,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:40,871 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 16:24:40,871 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:40,876 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 21 [2018-12-09 16:24:40,876 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:40,912 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 1 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 16:24:40,912 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 16:24:40,921 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:40,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:40,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:41,144 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:24:41,146 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 16:24:41,151 INFO L168 Benchmark]: Toolchain (without parser) took 161070.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 260.6 MB). Free memory was 948.1 MB in the beginning and 1.2 GB in the end (delta: -274.7 MB). Peak memory consumption was 434.5 MB. Max. memory is 11.5 GB. [2018-12-09 16:24:41,152 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:24:41,152 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2018-12-09 16:24:41,153 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:24:41,153 INFO L168 Benchmark]: Boogie Preprocessor took 15.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:24:41,153 INFO L168 Benchmark]: RCFGBuilder took 151.22 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:24:41,153 INFO L168 Benchmark]: TraceAbstraction took 160549.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.9 MB). Peak memory consumption was 436.9 MB. Max. memory is 11.5 GB. [2018-12-09 16:24:41,155 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.15 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 15.62 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 151.22 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 160549.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.9 MB). Peak memory consumption was 436.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 16:24:42,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:24:42,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:24:42,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:24:42,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:24:42,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:24:42,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:24:42,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:24:42,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:24:42,405 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:24:42,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:24:42,406 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:24:42,406 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:24:42,407 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:24:42,408 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:24:42,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:24:42,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:24:42,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:24:42,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:24:42,413 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:24:42,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:24:42,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:24:42,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:24:42,416 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:24:42,416 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:24:42,417 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:24:42,418 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:24:42,418 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:24:42,419 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:24:42,420 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:24:42,420 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:24:42,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:24:42,420 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:24:42,420 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:24:42,421 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:24:42,422 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:24:42,422 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 16:24:42,433 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:24:42,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:24:42,433 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:24:42,433 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:24:42,434 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:24:42,434 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:24:42,434 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:24:42,434 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:24:42,434 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:24:42,434 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:24:42,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:24:42,435 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:24:42,435 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:24:42,435 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:24:42,435 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 16:24:42,435 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:24:42,435 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:24:42,435 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:24:42,435 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 16:24:42,436 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 16:24:42,436 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 16:24:42,436 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:24:42,436 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 16:24:42,436 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 16:24:42,436 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:24:42,436 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 16:24:42,436 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:24:42,436 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:24:42,436 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:24:42,437 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:24:42,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:24:42,437 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:24:42,437 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:24:42,437 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 16:24:42,437 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:24:42,437 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 16:24:42,437 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_e0abc629-6bb7-49de-8f06-759e37d9b901/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 -> 95dd23c3faf110dda910911db52d9ffd09e9e4b3 [2018-12-09 16:24:42,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:24:42,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:24:42,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:24:42,469 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:24:42,469 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:24:42,470 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-09 16:24:42,504 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/data/f0a6495d2/3bd134be89b04d17b9db7f0c744dbba6/FLAG43bb881e5 [2018-12-09 16:24:42,952 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:24:42,952 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-09 16:24:42,962 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/data/f0a6495d2/3bd134be89b04d17b9db7f0c744dbba6/FLAG43bb881e5 [2018-12-09 16:24:42,973 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/data/f0a6495d2/3bd134be89b04d17b9db7f0c744dbba6 [2018-12-09 16:24:42,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:24:42,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:24:42,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:24:42,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:24:42,978 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:24:42,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:24:42" (1/1) ... [2018-12-09 16:24:42,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c36fe65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:42, skipping insertion in model container [2018-12-09 16:24:42,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:24:42" (1/1) ... [2018-12-09 16:24:42,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:24:43,008 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:24:43,201 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:24:43,213 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:24:43,288 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:24:43,329 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:24:43,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43 WrapperNode [2018-12-09 16:24:43,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:24:43,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:24:43,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:24:43,330 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:24:43,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43" (1/1) ... [2018-12-09 16:24:43,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43" (1/1) ... [2018-12-09 16:24:43,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:24:43,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:24:43,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:24:43,351 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:24:43,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43" (1/1) ... [2018-12-09 16:24:43,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43" (1/1) ... [2018-12-09 16:24:43,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43" (1/1) ... [2018-12-09 16:24:43,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43" (1/1) ... [2018-12-09 16:24:43,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43" (1/1) ... [2018-12-09 16:24:43,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43" (1/1) ... [2018-12-09 16:24:43,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43" (1/1) ... [2018-12-09 16:24:43,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:24:43,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:24:43,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:24:43,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:24:43,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:24:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:24:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 16:24:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 16:24:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:24:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:24:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:24:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:24:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 16:24:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 16:24:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 16:24:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 16:24:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:24:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:24:43,554 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:24:43,554 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 16:24:43,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:24:43 BoogieIcfgContainer [2018-12-09 16:24:43,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:24:43,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:24:43,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:24:43,557 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:24:43,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:24:42" (1/3) ... [2018-12-09 16:24:43,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e23335a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:24:43, skipping insertion in model container [2018-12-09 16:24:43,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:24:43" (2/3) ... [2018-12-09 16:24:43,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e23335a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:24:43, skipping insertion in model container [2018-12-09 16:24:43,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:24:43" (3/3) ... [2018-12-09 16:24:43,559 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-09 16:24:43,565 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:24:43,571 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 16:24:43,580 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 16:24:43,594 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 16:24:43,594 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:24:43,594 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 16:24:43,594 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:24:43,594 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:24:43,594 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:24:43,594 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:24:43,594 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:24:43,594 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:24:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-09 16:24:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 16:24:43,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:43,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:24:43,610 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:24:43,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1493808756, now seen corresponding path program 1 times [2018-12-09 16:24:43,616 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:24:43,617 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:24:43,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:43,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:24:43,712 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:24:43,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:43,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:24:43,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:24:43,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:24:43,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:24:43,725 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-12-09 16:24:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:43,805 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-09 16:24:43,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:24:43,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-09 16:24:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:43,814 INFO L225 Difference]: With dead ends: 41 [2018-12-09 16:24:43,814 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 16:24:43,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:24:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 16:24:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-12-09 16:24:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 16:24:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-09 16:24:43,840 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2018-12-09 16:24:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:43,840 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-09 16:24:43,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:24:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-09 16:24:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 16:24:43,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:43,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:24:43,842 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:24:43,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:43,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1058348205, now seen corresponding path program 1 times [2018-12-09 16:24:43,842 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:24:43,842 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:24:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:43,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:24:43,898 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:24:43,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:43,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:24:43,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:24:43,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:24:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:24:43,900 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-12-09 16:24:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:43,950 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-12-09 16:24:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:24:43,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 16:24:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:43,952 INFO L225 Difference]: With dead ends: 39 [2018-12-09 16:24:43,953 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 16:24:43,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:24:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 16:24:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-09 16:24:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 16:24:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-12-09 16:24:43,958 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2018-12-09 16:24:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:43,958 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-12-09 16:24:43,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:24:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-12-09 16:24:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 16:24:43,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:43,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:24:43,959 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:24:43,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:43,960 INFO L82 PathProgramCache]: Analyzing trace with hash -936037343, now seen corresponding path program 1 times [2018-12-09 16:24:43,960 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:24:43,960 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:24:43,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:44,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:24:44,023 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:24:44,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:44,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:24:44,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:24:44,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:24:44,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:24:44,024 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-12-09 16:24:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:44,060 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-12-09 16:24:44,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:24:44,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 16:24:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:44,062 INFO L225 Difference]: With dead ends: 46 [2018-12-09 16:24:44,063 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 16:24:44,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:24:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 16:24:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-12-09 16:24:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 16:24:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-09 16:24:44,067 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 18 [2018-12-09 16:24:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:44,067 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-09 16:24:44,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:24:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-12-09 16:24:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 16:24:44,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:44,068 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:24:44,068 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:24:44,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:44,068 INFO L82 PathProgramCache]: Analyzing trace with hash -489509575, now seen corresponding path program 1 times [2018-12-09 16:24:44,068 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:24:44,069 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:24:44,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:44,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:44,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:44,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:44,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:44,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:24:46,195 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 16:24:46,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:46,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:46,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 16:24:46,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:46,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:24:46,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-12-09 16:24:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-09 16:24:46,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:24:46,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:24:46,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:24:46,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:46,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:46,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:46,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:46,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:46,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:24:46,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:46,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:46,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 16:24:46,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:46,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:24:46,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-09 16:24:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-09 16:24:46,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:24:46,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:24:46,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 16:24:46,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:24:46,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:24:46,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2018-12-09 16:24:46,396 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 8 states. [2018-12-09 16:24:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:50,680 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-12-09 16:24:50,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:24:50,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-09 16:24:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:50,682 INFO L225 Difference]: With dead ends: 53 [2018-12-09 16:24:50,683 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 16:24:50,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2018-12-09 16:24:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 16:24:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2018-12-09 16:24:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 16:24:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2018-12-09 16:24:50,687 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 22 [2018-12-09 16:24:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:50,687 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-12-09 16:24:50,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:24:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2018-12-09 16:24:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 16:24:50,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:50,688 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:24:50,688 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:24:50,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:50,688 INFO L82 PathProgramCache]: Analyzing trace with hash -489509574, now seen corresponding path program 1 times [2018-12-09 16:24:50,688 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:24:50,688 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:24:50,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:50,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:50,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:50,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:50,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:50,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:50,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:50,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:24:51,645 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-09 16:24:51,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:51,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:51,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:24:51,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:51,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:24:51,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:51,686 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-09 16:24:51,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:24:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-09 16:24:51,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:24:51,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:24:51,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:24:51,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:51,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:51,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:51,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:52,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:52,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:52,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:52,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:24:52,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:52,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:52,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:52,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:52,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:24:52,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:52,052 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-09 16:24:52,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:24:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-09 16:24:52,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:24:52,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:24:52,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-09 16:24:52,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 16:24:52,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 16:24:52,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=1, NotChecked=18, Total=132 [2018-12-09 16:24:52,217 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 10 states. [2018-12-09 16:24:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:52,641 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-12-09 16:24:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 16:24:52,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-09 16:24:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:52,642 INFO L225 Difference]: With dead ends: 49 [2018-12-09 16:24:52,643 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 16:24:52,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2018-12-09 16:24:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 16:24:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-12-09 16:24:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 16:24:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2018-12-09 16:24:52,646 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 22 [2018-12-09 16:24:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:52,647 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2018-12-09 16:24:52,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 16:24:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2018-12-09 16:24:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 16:24:52,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:52,647 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:24:52,647 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:24:52,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:52,648 INFO L82 PathProgramCache]: Analyzing trace with hash -782912582, now seen corresponding path program 1 times [2018-12-09 16:24:52,648 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:24:52,648 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:24:52,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:52,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:24:52,726 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:24:52,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:24:52,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:24:52,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:24:52,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:24:52,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:24:52,728 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand 5 states. [2018-12-09 16:24:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:52,749 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-09 16:24:52,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:24:52,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 16:24:52,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:52,750 INFO L225 Difference]: With dead ends: 32 [2018-12-09 16:24:52,750 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 16:24:52,750 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-09 16:24:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 16:24:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 16:24:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 16:24:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-09 16:24:52,753 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2018-12-09 16:24:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:52,753 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-09 16:24:52,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:24:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-09 16:24:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 16:24:52,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:52,753 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:24:52,754 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:24:52,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:52,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1470466568, now seen corresponding path program 1 times [2018-12-09 16:24:52,754 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:24:52,754 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:24:52,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:52,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:24:52,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:24:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:24:52,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:24:52,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:24:52,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:52,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:24:52,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:24:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:24:52,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 16:24:52,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 8 [2018-12-09 16:24:52,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:24:52,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:24:52,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:24:52,931 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-12-09 16:24:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:53,029 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-12-09 16:24:53,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:24:53,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-09 16:24:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:53,030 INFO L225 Difference]: With dead ends: 44 [2018-12-09 16:24:53,030 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 16:24:53,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:24:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 16:24:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-12-09 16:24:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 16:24:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2018-12-09 16:24:53,033 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 27 [2018-12-09 16:24:53,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:53,033 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-12-09 16:24:53,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:24:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-12-09 16:24:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 16:24:53,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:53,034 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:24:53,034 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:24:53,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:53,034 INFO L82 PathProgramCache]: Analyzing trace with hash -934990959, now seen corresponding path program 1 times [2018-12-09 16:24:53,034 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:24:53,034 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:24:53,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:53,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:53,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:53,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:53,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:53,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:53,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:53,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:24:54,077 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-09 16:24:54,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:54,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:54,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:54,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:54,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:24:54,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:54,113 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-09 16:24:54,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:24:54,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:54,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:24:54,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:54,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:54,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:54,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:54,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:54,189 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-09 16:24:54,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:24:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2018-12-09 16:24:54,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:24:54,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:24:54,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:24:54,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:24:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:24:54,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:54,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:54,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:54,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:54,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:54,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:54,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:24:54,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:54,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:54,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:54,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:54,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:24:54,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:54,607 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-09 16:24:54,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:24:54,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:54,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:54,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:54,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:54,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:24:54,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:54,659 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-09 16:24:54,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:24:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2018-12-09 16:24:54,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:24:54,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:24:54,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-09 16:24:54,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 16:24:54,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 16:24:54,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2018-12-09 16:24:54,836 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 12 states. [2018-12-09 16:24:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:55,266 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-12-09 16:24:55,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:24:55,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-09 16:24:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:55,267 INFO L225 Difference]: With dead ends: 46 [2018-12-09 16:24:55,267 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 16:24:55,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=75, Invalid=348, Unknown=1, NotChecked=38, Total=462 [2018-12-09 16:24:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 16:24:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-12-09 16:24:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 16:24:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-12-09 16:24:55,270 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 31 [2018-12-09 16:24:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:55,270 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-09 16:24:55,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 16:24:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-12-09 16:24:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 16:24:55,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:55,271 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:24:55,271 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:24:55,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:55,271 INFO L82 PathProgramCache]: Analyzing trace with hash 230022938, now seen corresponding path program 2 times [2018-12-09 16:24:55,271 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:24:55,271 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:24:55,285 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 16:24:55,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 16:24:55,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:24:55,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:55,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:55,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:55,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:55,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:55,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:55,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:24:56,240 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-09 16:24:56,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:24:56,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:56,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,277 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-09 16:24:56,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:24:56,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:24:56,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:56,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,338 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-09 16:24:56,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:24:56,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:24:56,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:56,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,426 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-09 16:24:56,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:24:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2018-12-09 16:24:56,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:24:56,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:24:56,767 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:24:56,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 16:24:56,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 16:24:56,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:24:56,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:56,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:56,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:56,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:24:56,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:56,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:24:56,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,866 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-09 16:24:56,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:24:56,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:56,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:24:56,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,900 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-09 16:24:56,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:24:56,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:56,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:56,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:24:56,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:56,961 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-09 16:24:56,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:24:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2018-12-09 16:24:56,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:24:57,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:24:57,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-12-09 16:24:57,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 16:24:57,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 16:24:57,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2018-12-09 16:24:57,177 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 14 states. [2018-12-09 16:24:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:24:57,886 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-12-09 16:24:57,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 16:24:57,886 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-12-09 16:24:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:24:57,887 INFO L225 Difference]: With dead ends: 48 [2018-12-09 16:24:57,887 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 16:24:57,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=96, Invalid=507, Unknown=1, NotChecked=46, Total=650 [2018-12-09 16:24:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 16:24:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-12-09 16:24:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 16:24:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-12-09 16:24:57,890 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 40 [2018-12-09 16:24:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:24:57,890 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-12-09 16:24:57,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 16:24:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-12-09 16:24:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 16:24:57,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:24:57,890 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:24:57,891 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:24:57,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:24:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash -72608335, now seen corresponding path program 3 times [2018-12-09 16:24:57,891 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:24:57,891 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:24:57,904 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 16:24:58,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 16:24:58,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:24:58,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:24:58,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:58,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:58,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:24:58,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:58,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:58,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:24:59,048 WARN L180 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-09 16:24:59,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:59,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:59,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:59,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:59,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:24:59,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:59,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:59,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-09 16:24:59,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:59,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:24:59,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:59,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:59,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:24:59,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:24:59,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:24:59,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:24:59,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-09 16:25:00,213 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-09 16:25:00,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:00,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:00,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:00,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:00,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:00,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:00,244 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-09 16:25:00,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:00,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:00,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:00,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:25:00,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:00,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:00,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:00,378 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-09 16:25:00,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:25:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 12 not checked. [2018-12-09 16:25:00,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:25:00,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:25:00,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:25:00,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:25:00,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 16:25:00,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:25:00,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:25:00,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:00,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:00,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:00,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:00,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:00,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:25:00,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:00,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:00,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:00,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:01,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:25:01,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:01,018 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-09 16:25:01,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:25:01,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:01,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:01,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:01,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:01,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:25:01,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:01,053 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-09 16:25:01,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:25:01,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:01,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:01,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:01,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:01,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:25:01,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:01,083 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-09 16:25:01,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:25:01,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:01,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:01,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:01,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:01,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:01,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:01,151 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-09 16:25:01,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 24 trivial. 8 not checked. [2018-12-09 16:25:01,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:25:01,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:25:01,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 18 [2018-12-09 16:25:01,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 16:25:01,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 16:25:01,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2018-12-09 16:25:01,375 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 19 states. [2018-12-09 16:25:03,772 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-12-09 16:25:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:25:14,011 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-12-09 16:25:14,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 16:25:14,011 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-09 16:25:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:25:14,012 INFO L225 Difference]: With dead ends: 54 [2018-12-09 16:25:14,012 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 16:25:14,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=142, Invalid=983, Unknown=1, NotChecked=64, Total=1190 [2018-12-09 16:25:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 16:25:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-09 16:25:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 16:25:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-12-09 16:25:14,015 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 49 [2018-12-09 16:25:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:25:14,015 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-12-09 16:25:14,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 16:25:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-12-09 16:25:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 16:25:14,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:25:14,016 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:25:14,016 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:25:14,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:25:14,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1915928545, now seen corresponding path program 2 times [2018-12-09 16:25:14,016 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:25:14,016 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:25:14,033 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 16:25:14,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 16:25:14,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:25:14,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:25:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-09 16:25:14,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:25:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 16:25:14,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:25:14,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:25:14,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 16:25:14,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 16:25:14,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:25:14,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:25:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-09 16:25:14,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:25:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 16:25:14,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 16:25:14,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11, 10] total 19 [2018-12-09 16:25:14,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 16:25:14,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 16:25:14,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:25:14,611 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 19 states. [2018-12-09 16:25:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:25:15,562 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2018-12-09 16:25:15,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 16:25:15,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-12-09 16:25:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:25:15,563 INFO L225 Difference]: With dead ends: 77 [2018-12-09 16:25:15,563 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 16:25:15,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=464, Unknown=0, NotChecked=0, Total=702 [2018-12-09 16:25:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 16:25:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-12-09 16:25:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 16:25:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2018-12-09 16:25:15,568 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 54 [2018-12-09 16:25:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:25:15,569 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2018-12-09 16:25:15,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 16:25:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2018-12-09 16:25:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 16:25:15,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:25:15,570 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:25:15,570 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:25:15,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:25:15,570 INFO L82 PathProgramCache]: Analyzing trace with hash -140224262, now seen corresponding path program 4 times [2018-12-09 16:25:15,571 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:25:15,571 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:25:15,585 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 16:25:15,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 16:25:15,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:25:15,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:25:15,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:15,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:15,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:15,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:15,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:15,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:25:16,677 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-09 16:25:16,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:16,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:16,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:16,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:16,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:25:16,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:16,711 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-09 16:25:16,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:25:16,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:16,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:16,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:16,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:16,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:25:16,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:16,773 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-09 16:25:16,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:25:16,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:16,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:16,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:16,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:16,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:25:16,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:16,838 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-09 16:25:16,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:25:16,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:16,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:16,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:16,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:16,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:25:16,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:16,910 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-09 16:25:16,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:25:16,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:16,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:16,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:16,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:16,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:16,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:16,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:16,990 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-09 16:25:16,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2018-12-09 16:25:17,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:25:17,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:25:17,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:25:17,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 16:25:17,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 16:25:17,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:25:17,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:25:17,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:17,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:17,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:25:17,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:17,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:17,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,482 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-09 16:25:17,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:17,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:17,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:25:17,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,515 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-09 16:25:17,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:25:17,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:25:17,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:25:17,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,550 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-09 16:25:17,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 16:25:17,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:17,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:17,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,586 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-09 16:25:17,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:17,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:17,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:17,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:17,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:17,676 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-09 16:25:17,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2018-12-09 16:25:17,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:25:17,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:25:17,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-12-09 16:25:17,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 16:25:17,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 16:25:17,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2018-12-09 16:25:17,905 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand 18 states. [2018-12-09 16:25:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:25:19,139 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2018-12-09 16:25:19,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 16:25:19,140 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-12-09 16:25:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:25:19,141 INFO L225 Difference]: With dead ends: 82 [2018-12-09 16:25:19,141 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 16:25:19,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=138, Invalid=921, Unknown=1, NotChecked=62, Total=1122 [2018-12-09 16:25:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 16:25:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-12-09 16:25:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 16:25:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 96 transitions. [2018-12-09 16:25:19,145 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 96 transitions. Word has length 58 [2018-12-09 16:25:19,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:25:19,145 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 96 transitions. [2018-12-09 16:25:19,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 16:25:19,145 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2018-12-09 16:25:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 16:25:19,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:25:19,146 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:25:19,146 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:25:19,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:25:19,146 INFO L82 PathProgramCache]: Analyzing trace with hash -734480431, now seen corresponding path program 5 times [2018-12-09 16:25:19,146 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:25:19,146 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:25:19,161 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-09 16:25:19,466 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-09 16:25:19,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:25:19,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:25:19,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:19,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:19,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:19,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:25:20,419 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| |c_ldv_malloc_#in~size|))) is different from true [2018-12-09 16:25:20,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:20,431 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 14 treesize of output 15 [2018-12-09 16:25:20,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 16:25:20,445 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-09 16:25:20,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:32 [2018-12-09 16:25:21,681 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-09 16:25:21,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:21,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:21,689 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 34 treesize of output 26 [2018-12-09 16:25:21,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:21,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:21,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:21,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:21,760 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 39 treesize of output 56 [2018-12-09 16:25:21,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:25:21,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:21,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:21,858 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 38 treesize of output 30 [2018-12-09 16:25:21,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:21,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:21,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:21,863 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 36 treesize of output 28 [2018-12-09 16:25:21,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:21,931 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 26 treesize of output 25 [2018-12-09 16:25:21,932 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:21,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-09 16:25:21,979 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:74, output treesize:54 [2018-12-09 16:25:22,920 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)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 16:25:22,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:22,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:22,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:22,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:22,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:22,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 16:25:22,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:22,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:25:22,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-12-09 16:25:23,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:23,037 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 14 treesize of output 17 [2018-12-09 16:25:23,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:23,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:23,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:23,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:23,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-12-09 16:25:23,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:23,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 16:25:23,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2018-12-09 16:25:23,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:23,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:23,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:23,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:23,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-12-09 16:25:23,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:23,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:23,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:23,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:23,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:54, output treesize:14 [2018-12-09 16:25:23,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:23,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:23,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:23,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:23,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:23,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:23,378 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-09 16:25:23,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 80 refuted. 0 times theorem prover too weak. 28 trivial. 34 not checked. [2018-12-09 16:25:23,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:25:23,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:25:23,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:25:23,782 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 16:25:24,814 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-09 16:25:24,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:25:24,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:25:24,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:24,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:24,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:24,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:24,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:24,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:25:24,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:24,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:24,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:24,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:24,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:24,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:24,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:24,997 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-09 16:25:24,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:25,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:25,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:25,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 16:25:25,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:25,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:25,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:25,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:25:25,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:31 [2018-12-09 16:25:25,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:25,128 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 14 treesize of output 17 [2018-12-09 16:25:25,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:25,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:25,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:25,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:25,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-12-09 16:25:25,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:25,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 16:25:25,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:45, output treesize:42 [2018-12-09 16:25:25,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:25,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:25,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:25,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:25,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:25,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:25,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:25,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-12-09 16:25:25,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:25,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 16:25:25,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:58, output treesize:59 [2018-12-09 16:25:26,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:26,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:26,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:26,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:26,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:26,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:26,679 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:25:26,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2018-12-09 16:25:26,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:26,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 16:25:26,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:80, output treesize:84 [2018-12-09 16:25:27,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:27,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:27,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:27,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:27,201 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:25:27,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-12-09 16:25:27,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:27,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:27,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:27,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:27,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:95, output treesize:14 [2018-12-09 16:25:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 76 refuted. 0 times theorem prover too weak. 44 trivial. 28 not checked. [2018-12-09 16:25:27,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:25:27,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:25:27,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 35 [2018-12-09 16:25:27,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-09 16:25:27,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-09 16:25:27,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1060, Unknown=3, NotChecked=204, Total=1406 [2018-12-09 16:25:27,604 INFO L87 Difference]: Start difference. First operand 72 states and 96 transitions. Second operand 36 states. [2018-12-09 16:25:34,886 WARN L180 SmtUtils]: Spent 7.08 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-09 16:25:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:25:39,389 INFO L93 Difference]: Finished difference Result 126 states and 166 transitions. [2018-12-09 16:25:39,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 16:25:39,390 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-12-09 16:25:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:25:39,391 INFO L225 Difference]: With dead ends: 126 [2018-12-09 16:25:39,391 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 16:25:39,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=305, Invalid=2784, Unknown=3, NotChecked=330, Total=3422 [2018-12-09 16:25:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 16:25:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2018-12-09 16:25:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 16:25:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2018-12-09 16:25:39,398 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 67 [2018-12-09 16:25:39,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:25:39,399 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2018-12-09 16:25:39,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-09 16:25:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2018-12-09 16:25:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 16:25:39,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:25:39,400 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:25:39,401 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:25:39,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:25:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1550383024, now seen corresponding path program 1 times [2018-12-09 16:25:39,401 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:25:39,401 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:25:39,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:25:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:25:39,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:25:39,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:39,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:39,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:39,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:39,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:39,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:25:40,514 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-09 16:25:40,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:40,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:40,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:40,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:40,546 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-09 16:25:40,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:40,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:40,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:40,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:25:40,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:40,607 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-09 16:25:40,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:25:40,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:40,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:40,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:40,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:40,693 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-09 16:25:40,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:40,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:40,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:40,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:40,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:40,779 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-09 16:25:40,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:40,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:40,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:40,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:40,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:40,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:40,858 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-09 16:25:40,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 50 trivial. 20 not checked. [2018-12-09 16:25:40,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:25:41,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:25:41,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:25:41,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:25:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:25:41,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:25:41,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:41,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:41,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:41,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:41,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:41,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:25:41,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:41,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:41,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:41,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:41,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:41,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:41,371 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-09 16:25:41,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:42,410 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)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 16:25:42,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:25:42,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:42,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 16:25:42,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:42,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:25:42,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:27 [2018-12-09 16:25:42,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,571 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 14 treesize of output 17 [2018-12-09 16:25:42,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:42,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,592 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:25:42,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 16:25:42,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:42,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:42,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:14 [2018-12-09 16:25:42,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:42,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:42,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:42,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:42,640 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-09 16:25:42,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:42,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:42,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:42,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:42,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:42,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:42,707 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-09 16:25:42,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 42 trivial. 28 not checked. [2018-12-09 16:25:42,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:25:42,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:25:42,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 22 [2018-12-09 16:25:42,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 16:25:42,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 16:25:42,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=432, Unknown=2, NotChecked=86, Total=600 [2018-12-09 16:25:42,942 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand 23 states. [2018-12-09 16:25:44,758 WARN L180 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-09 16:25:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:25:45,882 INFO L93 Difference]: Finished difference Result 107 states and 142 transitions. [2018-12-09 16:25:45,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 16:25:45,883 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2018-12-09 16:25:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:25:45,883 INFO L225 Difference]: With dead ends: 107 [2018-12-09 16:25:45,883 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 16:25:45,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=170, Invalid=1168, Unknown=2, NotChecked=142, Total=1482 [2018-12-09 16:25:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 16:25:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 72. [2018-12-09 16:25:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 16:25:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2018-12-09 16:25:45,887 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 67 [2018-12-09 16:25:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:25:45,887 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2018-12-09 16:25:45,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 16:25:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-12-09 16:25:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 16:25:45,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:25:45,888 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:25:45,888 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:25:45,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:25:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash -10741030, now seen corresponding path program 6 times [2018-12-09 16:25:45,889 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:25:45,889 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:25:45,905 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-12-09 16:25:46,663 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-12-09 16:25:46,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:25:46,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:25:46,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:46,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:46,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:25:46,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:46,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:46,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:25:47,695 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)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 16:25:47,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:47,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:25:47,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:47,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:47,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:47,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 16:25:47,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:47,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:25:47,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-12-09 16:25:47,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:47,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:47,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:47,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-12-09 16:25:47,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:47,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:25:47,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:47,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 16:25:47,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:45, output treesize:41 [2018-12-09 16:25:47,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:47,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:47,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:48,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:48,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:48,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:48,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:48,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-12-09 16:25:48,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:48,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 16:25:48,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:62, output treesize:62 [2018-12-09 16:25:49,161 WARN L180 SmtUtils]: Spent 956.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-09 16:25:49,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:49,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:49,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:49,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:49,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:49,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:49,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:49,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:49,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-12-09 16:25:49,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:49,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:49,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:75, output treesize:18 [2018-12-09 16:25:49,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:49,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:49,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:49,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:49,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:49,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:49,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:49,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:49,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-09 16:25:49,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:49,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:49,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:25:49,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:49,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:49,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:49,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:25:49,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-09 16:25:50,505 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-09 16:25:50,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:50,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:25:50,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:50,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:50,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:25:50,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 13 treesize of output 4 [2018-12-09 16:25:50,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:25:50,540 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-09 16:25:50,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:25:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 7 proven. 112 refuted. 0 times theorem prover too weak. 54 trivial. 38 not checked. [2018-12-09 16:25:50,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:25:51,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:25:51,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:25:51,023 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-09 16:26:11,744 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-12-09 16:26:11,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:26:11,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:26:11,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:11,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:11,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:11,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:11,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:11,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:26:11,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:11,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:26:11,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:11,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:11,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:11,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:11,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:11,808 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-09 16:26:11,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:26:11,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:11,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:11,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:11,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:11,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:11,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:11,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:11,916 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-09 16:26:11,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:12,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:12,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:12,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 16:26:12,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:12,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:26:12,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:12,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:26:12,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:27 [2018-12-09 16:26:12,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:12,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:12,167 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:26:12,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 16:26:12,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:12,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:12,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:12,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:12,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:14 [2018-12-09 16:26:12,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:12,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:12,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:12,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:12,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:12,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:12,241 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-09 16:26:12,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:12,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:12,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:12,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:26:12,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:12,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:12,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:12,275 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-09 16:26:12,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:26:12,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:12,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:12,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:12,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:12,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:12,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:12,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:12,376 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-09 16:26:12,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 7 proven. 106 refuted. 0 times theorem prover too weak. 72 trivial. 26 not checked. [2018-12-09 16:26:12,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:26:12,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:26:12,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 33 [2018-12-09 16:26:12,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-09 16:26:12,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-09 16:26:12,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=992, Unknown=3, NotChecked=130, Total=1260 [2018-12-09 16:26:12,665 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 34 states. [2018-12-09 16:26:16,022 WARN L180 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-12-09 16:26:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:26:35,461 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-12-09 16:26:35,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 16:26:35,461 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2018-12-09 16:26:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:26:35,462 INFO L225 Difference]: With dead ends: 110 [2018-12-09 16:26:35,462 INFO L226 Difference]: Without dead ends: 110 [2018-12-09 16:26:35,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=322, Invalid=2875, Unknown=3, NotChecked=222, Total=3422 [2018-12-09 16:26:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-09 16:26:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 72. [2018-12-09 16:26:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 16:26:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2018-12-09 16:26:35,466 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 94 transitions. Word has length 76 [2018-12-09 16:26:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:26:35,467 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 94 transitions. [2018-12-09 16:26:35,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-09 16:26:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2018-12-09 16:26:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 16:26:35,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:26:35,468 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:26:35,468 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:26:35,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:26:35,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1460858383, now seen corresponding path program 7 times [2018-12-09 16:26:35,469 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:26:35,469 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:26:35,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:26:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:26:35,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:26:35,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:35,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:35,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:35,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:35,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:35,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:26:36,770 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-09 16:26:36,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:36,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:36,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:36,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:36,803 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-09 16:26:36,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:36,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:36,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:36,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:36,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:36,867 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-09 16:26:36,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:36,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:36,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:36,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:36,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:36,934 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-09 16:26:36,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:36,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:36,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:36,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:36,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:26:36,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,004 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-09 16:26:37,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:26:37,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:37,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:26:37,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,080 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-09 16:26:37,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:26:37,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:37,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:37,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,156 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-09 16:26:37,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:37,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:37,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:26:37,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,236 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-09 16:26:37,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:26:37,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:37,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:37,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,318 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-09 16:26:37,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 112 trivial. 16 not checked. [2018-12-09 16:26:37,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:26:37,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:26:37,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:26:37,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:26:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:26:37,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:26:37,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:37,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:37,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:26:37,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:37,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:26:37,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,935 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-09 16:26:37,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:26:37,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:37,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:26:37,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,970 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-09 16:26:37,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:26:37,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:37,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:37,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:37,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:37,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:38,005 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-09 16:26:38,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:38,665 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)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 16:26:38,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:38,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:38,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:38,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:38,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:38,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 16:26:38,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:38,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:26:38,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-12-09 16:26:38,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:38,808 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 14 treesize of output 17 [2018-12-09 16:26:38,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:38,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:38,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:38,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:38,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-12-09 16:26:38,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:38,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 16:26:38,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:44 [2018-12-09 16:26:38,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:38,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:39,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:39,001 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:26:39,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 61 [2018-12-09 16:26:39,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:39,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:39,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:39,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 16:26:39,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:61, output treesize:63 [2018-12-09 16:26:39,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:39,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:39,247 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:26:39,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2018-12-09 16:26:39,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:39,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:39,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:39,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:39,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:74, output treesize:14 [2018-12-09 16:26:39,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:39,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:39,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:39,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:39,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:39,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:39,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:39,457 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-09 16:26:39,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 82 trivial. 46 not checked. [2018-12-09 16:26:39,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:26:39,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:26:39,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 30 [2018-12-09 16:26:39,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-09 16:26:39,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-09 16:26:39,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=815, Unknown=2, NotChecked=118, Total=1056 [2018-12-09 16:26:39,730 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. Second operand 31 states. [2018-12-09 16:26:41,644 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-09 16:26:45,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:26:45,989 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-12-09 16:26:45,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 16:26:45,990 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 85 [2018-12-09 16:26:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:26:45,990 INFO L225 Difference]: With dead ends: 104 [2018-12-09 16:26:45,990 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 16:26:45,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=251, Invalid=2107, Unknown=2, NotChecked=190, Total=2550 [2018-12-09 16:26:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 16:26:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-12-09 16:26:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-09 16:26:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2018-12-09 16:26:45,995 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 85 [2018-12-09 16:26:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:26:45,995 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2018-12-09 16:26:45,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-09 16:26:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2018-12-09 16:26:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 16:26:45,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:26:45,996 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:26:45,996 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:26:45,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:26:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash -721652527, now seen corresponding path program 2 times [2018-12-09 16:26:45,996 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:26:45,996 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:26:46,021 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 16:26:46,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 16:26:46,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:26:46,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:26:46,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:46,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:46,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:46,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:46,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:46,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:26:47,238 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-09 16:26:47,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:47,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:47,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,274 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-09 16:26:47,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:47,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:47,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:47,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,340 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-09 16:26:47,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:47,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:47,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:47,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,410 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-09 16:26:47,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:47,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,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 14 treesize of output 17 [2018-12-09 16:26:47,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:47,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,482 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-09 16:26:47,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:47,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:26:47,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:26:47,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,555 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-09 16:26:47,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 16:26:47,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:47,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:47,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:47,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:47,713 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-09 16:26:47,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 145 refuted. 0 times theorem prover too weak. 88 trivial. 36 not checked. [2018-12-09 16:26:47,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:26:48,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:26:48,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:26:48,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 16:26:48,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 16:26:48,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:26:48,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:26:48,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:48,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:48,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:26:48,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:26:48,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:48,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,302 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-09 16:26:48,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:26:48,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:48,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:48,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,338 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-09 16:26:48,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:48,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:48,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:48,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,389 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-09 16:26:48,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:48,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:26:48,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:26:48,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,422 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-09 16:26:48,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 16:26:48,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:48,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:26:48,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,458 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-09 16:26:48,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:26:48,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:48,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:48,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:48,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:48,555 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-09 16:26:48,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 145 refuted. 0 times theorem prover too weak. 88 trivial. 36 not checked. [2018-12-09 16:26:48,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:26:48,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:26:48,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-12-09 16:26:48,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 16:26:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 16:26:48,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=436, Unknown=1, NotChecked=42, Total=552 [2018-12-09 16:26:48,821 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand 22 states. [2018-12-09 16:26:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:26:50,705 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2018-12-09 16:26:50,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 16:26:50,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2018-12-09 16:26:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:26:50,706 INFO L225 Difference]: With dead ends: 117 [2018-12-09 16:26:50,707 INFO L226 Difference]: Without dead ends: 117 [2018-12-09 16:26:50,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=179, Invalid=1464, Unknown=1, NotChecked=78, Total=1722 [2018-12-09 16:26:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-09 16:26:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2018-12-09 16:26:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-09 16:26:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2018-12-09 16:26:50,711 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 85 [2018-12-09 16:26:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:26:50,712 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2018-12-09 16:26:50,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 16:26:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2018-12-09 16:26:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 16:26:50,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:26:50,713 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:26:50,713 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:26:50,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:26:50,713 INFO L82 PathProgramCache]: Analyzing trace with hash 318446447, now seen corresponding path program 3 times [2018-12-09 16:26:50,714 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:26:50,714 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:26:50,736 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 16:26:51,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-09 16:26:51,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:26:51,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:26:51,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:51,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:51,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:26:51,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:51,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:26:51,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:26:52,173 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-09 16:26:52,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:52,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:52,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:52,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:52,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:52,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:52,207 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-09 16:26:52,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:52,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:52,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:52,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:52,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:52,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:52,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:52,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:52,273 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-09 16:26:52,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:52,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:52,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:52,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:52,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:52,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:52,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:26:52,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:52,339 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-09 16:26:52,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:26:53,378 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| |c_ldv_malloc_#in~size|))) is different from true [2018-12-09 16:26:53,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:53,390 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 14 treesize of output 15 [2018-12-09 16:26:53,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 16:26:53,405 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-09 16:26:53,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:32 [2018-12-09 16:26:54,727 WARN L180 SmtUtils]: Spent 969.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-09 16:26:54,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:54,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:54,735 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 39 treesize of output 31 [2018-12-09 16:26:54,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:54,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:54,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:54,813 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 31 treesize of output 44 [2018-12-09 16:26:54,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:26:54,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:54,896 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 34 treesize of output 37 [2018-12-09 16:26:54,897 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:54,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:54,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:54,949 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 33 treesize of output 25 [2018-12-09 16:26:54,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:54,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-09 16:26:54,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:74, output treesize:66 [2018-12-09 16:26:55,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:55,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:26:55,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:55,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:55,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:26:55,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:26:55,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:26:55,465 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-09 16:26:55,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:26:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 17 proven. 174 refuted. 0 times theorem prover too weak. 38 trivial. 48 not checked. [2018-12-09 16:26:55,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:26:56,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:26:56,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:26:56,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:27:02,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-09 16:27:02,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:27:02,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:27:02,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:27:02,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:02,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:27:02,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:02,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:27:02,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:27:02,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:02,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:02,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:02,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:02,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:02,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:02,868 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-09 16:27:02,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:02,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:02,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:27:02,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:02,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:02,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:02,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:02,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:02,901 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-09 16:27:02,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:27:02,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:02,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:02,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:02,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:02,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:02,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:02,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:02,940 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-09 16:27:02,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:02,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:02,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:02,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:03,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:03,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:03,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:03,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:03,013 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-09 16:27:03,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:03,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:03,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:03,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:03,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:03,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:03,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:03,172 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-09 16:27:03,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:03,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:03,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:27:03,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:03,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:03,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:03,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:03,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:03,309 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-09 16:27:03,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:27:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 14 proven. 163 refuted. 0 times theorem prover too weak. 64 trivial. 36 not checked. [2018-12-09 16:27:03,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:27:03,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:27:03,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 33 [2018-12-09 16:27:03,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-09 16:27:03,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-09 16:27:03,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1019, Unknown=2, NotChecked=130, Total=1260 [2018-12-09 16:27:03,611 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand 34 states. [2018-12-09 16:27:06,446 WARN L180 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2018-12-09 16:27:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:27:22,248 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2018-12-09 16:27:22,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 16:27:22,249 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 85 [2018-12-09 16:27:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:27:22,249 INFO L225 Difference]: With dead ends: 118 [2018-12-09 16:27:22,249 INFO L226 Difference]: Without dead ends: 118 [2018-12-09 16:27:22,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=275, Invalid=3037, Unknown=2, NotChecked=226, Total=3540 [2018-12-09 16:27:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-09 16:27:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 72. [2018-12-09 16:27:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 16:27:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2018-12-09 16:27:22,252 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 85 [2018-12-09 16:27:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:27:22,252 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2018-12-09 16:27:22,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-09 16:27:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2018-12-09 16:27:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 16:27:22,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:27:22,253 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:27:22,253 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:27:22,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:27:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1877269318, now seen corresponding path program 8 times [2018-12-09 16:27:22,253 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:27:22,254 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:27:22,275 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 16:27:22,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 16:27:22,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:27:22,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:27:22,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:27:22,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:22,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:27:22,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:22,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:27:22,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:27:23,608 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-09 16:27:23,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:23,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:23,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:23,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:23,644 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-09 16:27:23,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:23,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:27:23,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:23,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:23,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:23,707 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-09 16:27:23,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:27:23,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:27:23,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:23,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:23,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:23,773 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-09 16:27:23,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:27:23,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:23,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:23,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:23,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:23,841 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-09 16:27:23,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:23,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:23,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:23,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:23,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:23,927 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-09 16:27:23,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:23,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:23,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:23,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:24,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:24,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:24,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 13 treesize of output 4 [2018-12-09 16:27:24,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:24,022 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-09 16:27:24,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:24,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:24,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:24,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:24,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:24,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:24,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:24,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:24,125 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-09 16:27:24,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:24,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:24,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:27:24,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:24,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:24,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:24,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:24,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:24,207 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-09 16:27:24,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:27:24,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:24,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:24,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:24,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:24,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:24,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:24,325 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-09 16:27:24,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 181 refuted. 0 times theorem prover too weak. 144 trivial. 18 not checked. [2018-12-09 16:27:24,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:27:24,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:27:24,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:27:24,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 16:27:24,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 16:27:24,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:27:24,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:27:24,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:27:24,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:24,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:27:24,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:24,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:27:24,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:27:26,730 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)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 16:27:26,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:26,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:26,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 16:27:26,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:26,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:26,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:26,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:27:26,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-09 16:27:26,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:26,932 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 12 treesize of output 15 [2018-12-09 16:27:26,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:26,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:26,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:26,966 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:27:26,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 42 [2018-12-09 16:27:26,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:26,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 16:27:26,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:42 [2018-12-09 16:27:27,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:27,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:27:27,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:27,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:27,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:27,247 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:27:27,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 61 [2018-12-09 16:27:27,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:27,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 16:27:27,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:59, output treesize:61 [2018-12-09 16:27:27,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:27,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:27,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:27,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:27,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:27,629 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:27:27,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 84 [2018-12-09 16:27:27,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:27,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 16:27:27,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:80, output treesize:85 [2018-12-09 16:27:28,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,481 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:27:28,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:27:28,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 61 [2018-12-09 16:27:28,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:28,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:96, output treesize:14 [2018-12-09 16:27:28,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 16:27:28,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:28,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:27:28,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-09 16:27:28,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,777 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 14 treesize of output 17 [2018-12-09 16:27:28,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,809 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:27:28,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 16:27:28,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:14 [2018-12-09 16:27:28,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:27:28,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:28,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,862 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-09 16:27:28,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:27:28,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:28,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:28,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:28,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:28,968 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-09 16:27:28,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 181 refuted. 0 times theorem prover too weak. 104 trivial. 58 not checked. [2018-12-09 16:27:28,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:27:29,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:27:29,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 36 [2018-12-09 16:27:29,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-09 16:27:29,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-09 16:27:29,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1184, Unknown=2, NotChecked=142, Total=1482 [2018-12-09 16:27:29,265 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand 37 states. [2018-12-09 16:27:31,559 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-09 16:27:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:27:42,336 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2018-12-09 16:27:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 16:27:42,336 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 94 [2018-12-09 16:27:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:27:42,337 INFO L225 Difference]: With dead ends: 114 [2018-12-09 16:27:42,337 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 16:27:42,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 149 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=337, Invalid=3329, Unknown=2, NotChecked=238, Total=3906 [2018-12-09 16:27:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 16:27:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 72. [2018-12-09 16:27:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 16:27:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-12-09 16:27:42,340 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 94 [2018-12-09 16:27:42,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:27:42,340 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-12-09 16:27:42,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-09 16:27:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-12-09 16:27:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 16:27:42,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:27:42,341 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:27:42,342 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:27:42,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:27:42,342 INFO L82 PathProgramCache]: Analyzing trace with hash -733273071, now seen corresponding path program 9 times [2018-12-09 16:27:42,342 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:27:42,342 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:27:42,356 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 16:27:43,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-09 16:27:43,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:27:43,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:27:43,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:27:43,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:43,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:27:43,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:43,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:27:43,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:27:44,100 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)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 16:27:44,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:44,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:44,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:44,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:44,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:44,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 16:27:44,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:44,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:27:44,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-12-09 16:27:45,059 WARN L180 SmtUtils]: Spent 849.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-09 16:27:45,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:45,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:45,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:45,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-09 16:27:45,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:45,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:45,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:45,107 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-09 16:27:45,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:18 [2018-12-09 16:27:45,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:45,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:45,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:45,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:45,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:45,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:45,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:27:45,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-09 16:27:46,097 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-09 16:27:46,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:46,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:46,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:46,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:46,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:46,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:46,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:46,131 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-09 16:27:46,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:46,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:46,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:46,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:46,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:46,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:46,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:46,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:46,224 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-09 16:27:46,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:46,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:46,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 15 [2018-12-09 16:27:46,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 16:27:46,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:27:46,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:33 [2018-12-09 16:27:46,659 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 22 treesize of output 19 [2018-12-09 16:27:46,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:46,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:46,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:46,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2018-12-09 16:27:46,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:27:46,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 16:27:46,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:44 [2018-12-09 16:27:47,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,082 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 39 treesize of output 31 [2018-12-09 16:27:47,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:47,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,144 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 34 treesize of output 26 [2018-12-09 16:27:47,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:47,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,215 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 31 treesize of output 44 [2018-12-09 16:27:47,216 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 16:27:47,289 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 26 treesize of output 25 [2018-12-09 16:27:47,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:47,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-09 16:27:47,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:74, output treesize:66 [2018-12-09 16:27:47,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:27:47,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:47,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:47,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:47,728 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-09 16:27:47,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:27:47,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:27:47,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:47,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:27:47,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:27:47,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:27:47,970 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-09 16:27:47,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:27:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 18 proven. 272 refuted. 0 times theorem prover too weak. 78 trivial. 68 not checked. [2018-12-09 16:27:48,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:27:50,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:27:50,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:27:50,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:28:09,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-09 16:28:09,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:28:09,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:28:09,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:28:09,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:28:09,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:28:09,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:28:09,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:28:09,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,776 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-09 16:28:09,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 16:28:09,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:28:09,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:28:09,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,854 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-09 16:28:09,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:28:09,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:28:09,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:28:09,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,885 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-09 16:28:09,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:28:09,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:28:09,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:28:09,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,919 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-09 16:28:09,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:28:09,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:28:09,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:09,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:28:09,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:09,954 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-09 16:28:09,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:28:10,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:28:10,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:10,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:28:10,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:10,044 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-09 16:28:10,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:28:10,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:28:10,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:10,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:28:10,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:10,133 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-09 16:28:10,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 16:28:10,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:28:10,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:10,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:28:10,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:10,255 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-09 16:28:10,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:16 [2018-12-09 16:28:10,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:28:10,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:10,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:28:10,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:10,344 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-09 16:28:10,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 16:28:10,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:28:10,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 16:28:10,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:10,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:28:10,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:28:10,460 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-09 16:28:10,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 16:28:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 226 refuted. 0 times theorem prover too weak. 180 trivial. 20 not checked. [2018-12-09 16:28:10,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:28:10,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:28:10,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 27] total 44 [2018-12-09 16:28:10,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-09 16:28:10,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-09 16:28:10,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1832, Unknown=3, NotChecked=174, Total=2162 [2018-12-09 16:28:10,957 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 45 states. [2018-12-09 16:28:14,742 WARN L180 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-12-09 16:28:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:28:43,261 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2018-12-09 16:28:43,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 16:28:43,262 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 103 [2018-12-09 16:28:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:28:43,262 INFO L225 Difference]: With dead ends: 101 [2018-12-09 16:28:43,263 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 16:28:43,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 160 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=347, Invalid=4350, Unknown=3, NotChecked=270, Total=4970 [2018-12-09 16:28:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 16:28:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2018-12-09 16:28:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 16:28:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2018-12-09 16:28:43,266 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 103 [2018-12-09 16:28:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:28:43,266 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2018-12-09 16:28:43,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-09 16:28:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2018-12-09 16:28:43,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 16:28:43,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:28:43,267 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:28:43,267 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-09 16:28:43,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:28:43,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1398952575, now seen corresponding path program 3 times [2018-12-09 16:28:43,267 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:28:43,267 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0abc629-6bb7-49de-8f06-759e37d9b901/bin-2019/utaipan/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:28:43,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:28:44,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-09 16:28:44,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-09 16:28:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:28:46,456 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 16:28:46,476 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 16:28:46,489 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 16:28:46,489 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 16:28:46,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:28:46 BoogieIcfgContainer [2018-12-09 16:28:46,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:28:46,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:28:46,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:28:46,509 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:28:46,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:24:43" (3/4) ... [2018-12-09 16:28:46,513 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 16:28:46,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:28:46,514 INFO L168 Benchmark]: Toolchain (without parser) took 243538.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 939.3 MB in the beginning and 922.1 MB in the end (delta: 17.2 MB). Peak memory consumption was 185.0 MB. Max. memory is 11.5 GB. [2018-12-09 16:28:46,514 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-09 16:28:46,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-12-09 16:28:46,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:28:46,514 INFO L168 Benchmark]: Boogie Preprocessor took 18.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:28:46,514 INFO L168 Benchmark]: RCFGBuilder took 185.16 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-12-09 16:28:46,515 INFO L168 Benchmark]: TraceAbstraction took 242953.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.0 MB). Free memory was 1.1 GB in the beginning and 922.1 MB in the end (delta: 171.9 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. [2018-12-09 16:28:46,515 INFO L168 Benchmark]: Witness Printer took 4.03 ms. Allocated memory is still 1.2 GB. Free memory is still 922.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:28:46,515 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 353.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.58 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 18.26 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 185.16 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 242953.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.0 MB). Free memory was 1.1 GB in the beginning and 922.1 MB in the end (delta: 171.9 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.03 ms. Allocated memory is still 1.2 GB. Free memory is still 922.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1452]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1452. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={-2147221501:0}] [L1453] CALL entry_point() VAL [ldv_global_msg_list={-2147221501:0}] [L1439] int len = 10; VAL [ldv_global_msg_list={-2147221501:0}, len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40, ldv_global_msg_list={-2147221501:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=40, \result={262659:0}, ldv_global_msg_list={-2147221501:0}, malloc(size)={262659:0}, size=40] [L1440] RET, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_global_msg_list={-2147221501:0}, ldv_malloc(sizeof(struct A18*)*len)={262659:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; VAL [array={262659:0}, i=0, ldv_global_msg_list={-2147221501:0}, len=10] [L1443] COND FALSE !(!array) VAL [array={262659:0}, i=0, ldv_global_msg_list={-2147221501:0}, len=10] [L1444] COND TRUE i