./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db24912fd6b7f93a8f38fa3f07abfebcff2c46e9 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db24912fd6b7f93a8f38fa3f07abfebcff2c46e9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:26:30,850 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:26:30,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:26:30,857 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:26:30,857 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:26:30,858 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:26:30,858 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:26:30,859 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:26:30,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:26:30,860 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:26:30,861 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:26:30,861 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:26:30,861 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:26:30,862 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:26:30,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:26:30,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:26:30,863 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:26:30,864 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:26:30,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:26:30,866 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:26:30,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:26:30,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:26:30,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:26:30,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:26:30,868 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:26:30,869 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:26:30,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:26:30,870 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:26:30,870 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:26:30,871 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:26:30,871 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:26:30,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:26:30,871 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:26:30,871 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:26:30,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:26:30,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:26:30,872 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 01:26:30,879 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:26:30,880 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:26:30,880 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:26:30,880 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:26:30,880 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:26:30,880 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:26:30,880 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:26:30,881 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 01:26:30,881 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:26:30,881 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:26:30,881 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 01:26:30,881 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 01:26:30,881 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:26:30,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:26:30,881 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:26:30,881 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:26:30,882 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:26:30,882 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:26:30,882 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:26:30,882 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:26:30,882 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:26:30,882 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:26:30,882 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:26:30,882 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:26:30,882 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:26:30,882 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:26:30,882 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:26:30,882 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:26:30,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:26:30,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:26:30,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:26:30,883 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:26:30,883 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:26:30,883 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 01:26:30,883 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:26:30,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:26:30,883 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_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db24912fd6b7f93a8f38fa3f07abfebcff2c46e9 [2018-12-09 01:26:30,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:26:30,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:26:30,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:26:30,914 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:26:30,914 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:26:30,915 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-09 01:26:30,952 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/data/bd36fcdc4/61b1a8116f374f88aece0d7dcfb7493f/FLAGcc05c019e [2018-12-09 01:26:31,320 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:26:31,320 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-09 01:26:31,328 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/data/bd36fcdc4/61b1a8116f374f88aece0d7dcfb7493f/FLAGcc05c019e [2018-12-09 01:26:31,679 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/data/bd36fcdc4/61b1a8116f374f88aece0d7dcfb7493f [2018-12-09 01:26:31,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:26:31,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:26:31,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:26:31,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:26:31,685 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:26:31,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:26:31" (1/1) ... [2018-12-09 01:26:31,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61db98e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:31, skipping insertion in model container [2018-12-09 01:26:31,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:26:31" (1/1) ... [2018-12-09 01:26:31,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:26:31,714 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:26:31,931 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:26:31,941 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:26:31,974 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:26:32,007 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:26:32,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32 WrapperNode [2018-12-09 01:26:32,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:26:32,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:26:32,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:26:32,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:26:32,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32" (1/1) ... [2018-12-09 01:26:32,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32" (1/1) ... [2018-12-09 01:26:32,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:26:32,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:26:32,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:26:32,030 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:26:32,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32" (1/1) ... [2018-12-09 01:26:32,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32" (1/1) ... [2018-12-09 01:26:32,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32" (1/1) ... [2018-12-09 01:26:32,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32" (1/1) ... [2018-12-09 01:26:32,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32" (1/1) ... [2018-12-09 01:26:32,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32" (1/1) ... [2018-12-09 01:26:32,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32" (1/1) ... [2018-12-09 01:26:32,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:26:32,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:26:32,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:26:32,047 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:26:32,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/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 01:26:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:26:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 01:26:32,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 01:26:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:26:32,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:26:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:26:32,079 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:26:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:26:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2018-12-09 01:26:32,079 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2018-12-09 01:26:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2018-12-09 01:26:32,079 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2018-12-09 01:26:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-12-09 01:26:32,079 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-12-09 01:26:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:26:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 01:26:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 01:26:32,079 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 01:26:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:26:32,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:26:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-12-09 01:26:32,080 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-12-09 01:26:32,222 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:26:32,222 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 01:26:32,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:26:32 BoogieIcfgContainer [2018-12-09 01:26:32,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:26:32,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:26:32,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:26:32,225 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:26:32,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:26:31" (1/3) ... [2018-12-09 01:26:32,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5daead13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:26:32, skipping insertion in model container [2018-12-09 01:26:32,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:32" (2/3) ... [2018-12-09 01:26:32,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5daead13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:26:32, skipping insertion in model container [2018-12-09 01:26:32,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:26:32" (3/3) ... [2018-12-09 01:26:32,227 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-09 01:26:32,233 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:26:32,238 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-09 01:26:32,247 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-09 01:26:32,264 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:26:32,264 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:26:32,264 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:26:32,264 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:26:32,264 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:26:32,264 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:26:32,264 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:26:32,265 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:26:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-09 01:26:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:26:32,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:32,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:32,281 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:32,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:32,284 INFO L82 PathProgramCache]: Analyzing trace with hash -387705796, now seen corresponding path program 1 times [2018-12-09 01:26:32,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:26:32,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:32,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:26:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:32,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:32,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:26:32,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:26:32,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:26:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:26:32,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:32,420 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2018-12-09 01:26:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:32,457 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-12-09 01:26:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:26:32,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 01:26:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:32,465 INFO L225 Difference]: With dead ends: 72 [2018-12-09 01:26:32,465 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 01:26:32,466 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 01:26:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 01:26:32,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2018-12-09 01:26:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 01:26:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-12-09 01:26:32,492 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2018-12-09 01:26:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:32,492 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-12-09 01:26:32,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:26:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-12-09 01:26:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:26:32,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:32,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:32,494 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:32,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash -584219301, now seen corresponding path program 1 times [2018-12-09 01:26:32,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:26:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:26:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:32,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:32,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:26:32,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:26:32,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:26:32,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:26:32,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:26:32,540 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-12-09 01:26:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:32,615 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-12-09 01:26:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:26:32,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 01:26:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:32,616 INFO L225 Difference]: With dead ends: 88 [2018-12-09 01:26:32,616 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 01:26:32,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 01:26:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-12-09 01:26:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 01:26:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-12-09 01:26:32,622 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 20 [2018-12-09 01:26:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:32,623 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-12-09 01:26:32,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:26:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-12-09 01:26:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:26:32,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:32,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:32,624 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:32,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash -584219300, now seen corresponding path program 1 times [2018-12-09 01:26:32,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:26:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:32,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:26:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:32,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:32,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:26:32,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:26:32,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:26:32,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:26:32,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:26:32,665 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 4 states. [2018-12-09 01:26:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:32,726 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-12-09 01:26:32,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:26:32,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 01:26:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:32,728 INFO L225 Difference]: With dead ends: 106 [2018-12-09 01:26:32,728 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 01:26:32,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 01:26:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-12-09 01:26:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-09 01:26:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-12-09 01:26:32,735 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 20 [2018-12-09 01:26:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:32,735 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-12-09 01:26:32,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:26:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-12-09 01:26:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 01:26:32,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:32,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:32,737 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:32,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash -400934782, now seen corresponding path program 1 times [2018-12-09 01:26:32,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:26:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:26:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:32,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:32,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:26:32,773 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:26:32,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:26:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:26:32,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:32,774 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 5 states. [2018-12-09 01:26:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:32,784 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-12-09 01:26:32,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:26:32,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 01:26:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:32,786 INFO L225 Difference]: With dead ends: 86 [2018-12-09 01:26:32,786 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 01:26:32,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 01:26:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-09 01:26:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 01:26:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-12-09 01:26:32,790 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 22 [2018-12-09 01:26:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:32,790 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-12-09 01:26:32,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:26:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-12-09 01:26:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:26:32,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:32,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:32,791 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:32,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:32,792 INFO L82 PathProgramCache]: Analyzing trace with hash 455923737, now seen corresponding path program 1 times [2018-12-09 01:26:32,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:26:32,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:32,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:26:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:32,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:32,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:26:32,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:26:32,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:26:32,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:26:32,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:32,821 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 5 states. [2018-12-09 01:26:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:32,854 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-12-09 01:26:32,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:26:32,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 01:26:32,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:32,855 INFO L225 Difference]: With dead ends: 88 [2018-12-09 01:26:32,856 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 01:26:32,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:32,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 01:26:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-12-09 01:26:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 01:26:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-12-09 01:26:32,862 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 23 [2018-12-09 01:26:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:32,862 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-12-09 01:26:32,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:26:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-12-09 01:26:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:26:32,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:32,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:32,863 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:32,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:32,863 INFO L82 PathProgramCache]: Analyzing trace with hash 162520730, now seen corresponding path program 1 times [2018-12-09 01:26:32,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:26:32,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:32,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:26:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:32,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:32,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:26:32,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:26:32,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:26:32,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:26:32,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:32,900 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 5 states. [2018-12-09 01:26:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:32,909 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-12-09 01:26:32,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:26:32,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 01:26:32,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:32,910 INFO L225 Difference]: With dead ends: 61 [2018-12-09 01:26:32,910 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 01:26:32,910 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 01:26:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 01:26:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-09 01:26:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 01:26:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-12-09 01:26:32,913 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 23 [2018-12-09 01:26:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:32,913 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-12-09 01:26:32,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:26:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-12-09 01:26:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 01:26:32,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:32,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:32,914 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:32,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:32,914 INFO L82 PathProgramCache]: Analyzing trace with hash -389142984, now seen corresponding path program 1 times [2018-12-09 01:26:32,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:26:32,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:32,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:32,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:26:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:33,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:33,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:26:33,004 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:26:33,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:26:33,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:26:33,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:26:33,005 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 7 states. [2018-12-09 01:26:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:33,157 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-09 01:26:33,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:26:33,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-09 01:26:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:33,158 INFO L225 Difference]: With dead ends: 61 [2018-12-09 01:26:33,158 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 01:26:33,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:26:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 01:26:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-12-09 01:26:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 01:26:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-12-09 01:26:33,161 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-12-09 01:26:33,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:33,161 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-12-09 01:26:33,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:26:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-12-09 01:26:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 01:26:33,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:33,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:33,162 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:33,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash -389142983, now seen corresponding path program 1 times [2018-12-09 01:26:33,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:26:33,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:33,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:33,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:33,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:26:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:33,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:33,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:26:33,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:26:33,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:26:33,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:26:33,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:26:33,228 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 8 states. [2018-12-09 01:26:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:33,348 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-12-09 01:26:33,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:26:33,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-09 01:26:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:33,349 INFO L225 Difference]: With dead ends: 54 [2018-12-09 01:26:33,349 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 01:26:33,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:26:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 01:26:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-09 01:26:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 01:26:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-12-09 01:26:33,353 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 28 [2018-12-09 01:26:33,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:33,353 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-12-09 01:26:33,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:26:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-12-09 01:26:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 01:26:33,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:33,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:33,354 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:33,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:33,355 INFO L82 PathProgramCache]: Analyzing trace with hash -956170858, now seen corresponding path program 1 times [2018-12-09 01:26:33,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:26:33,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:33,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:33,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:33,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:26:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:33,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:33,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:26:33,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:26:33,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:26:33,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:26:33,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:26:33,445 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2018-12-09 01:26:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:33,607 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-09 01:26:33,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:26:33,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-09 01:26:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:33,608 INFO L225 Difference]: With dead ends: 56 [2018-12-09 01:26:33,608 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 01:26:33,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:26:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 01:26:33,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 01:26:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 01:26:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-09 01:26:33,611 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 28 [2018-12-09 01:26:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:33,612 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-09 01:26:33,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:26:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-09 01:26:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 01:26:33,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:33,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:33,613 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:33,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1235066613, now seen corresponding path program 1 times [2018-12-09 01:26:33,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:26:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:33,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:33,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:26:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:33,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:33,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:26:33,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:26:33,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:26:33,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:26:33,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:33,641 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 5 states. [2018-12-09 01:26:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:33,645 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-12-09 01:26:33,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:26:33,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-09 01:26:33,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:33,646 INFO L225 Difference]: With dead ends: 42 [2018-12-09 01:26:33,646 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 01:26:33,646 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 01:26:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 01:26:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 01:26:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 01:26:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-12-09 01:26:33,648 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 37 [2018-12-09 01:26:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:33,648 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-12-09 01:26:33,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:26:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-12-09 01:26:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 01:26:33,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:33,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:33,649 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:33,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:33,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1878309586, now seen corresponding path program 1 times [2018-12-09 01:26:33,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:26:33,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:33,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:33,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:26:33,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:26:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:26:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:26:33,681 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 01:26:33,690 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 01:26:33,697 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 01:26:33,697 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 18 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-09 01:26:33,697 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-09 01:26:33,698 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 01:26:33,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:26:33 BoogieIcfgContainer [2018-12-09 01:26:33,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:26:33,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:26:33,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:26:33,705 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:26:33,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:26:32" (3/4) ... [2018-12-09 01:26:33,708 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 01:26:33,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:26:33,709 INFO L168 Benchmark]: Toolchain (without parser) took 2027.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 952.4 MB in the beginning and 779.9 MB in the end (delta: 172.5 MB). Peak memory consumption was 286.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:26:33,710 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:26:33,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -128.3 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:26:33,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:26:33,711 INFO L168 Benchmark]: Boogie Preprocessor took 16.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:26:33,711 INFO L168 Benchmark]: RCFGBuilder took 176.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:26:33,711 INFO L168 Benchmark]: TraceAbstraction took 1481.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 779.9 MB in the end (delta: 275.7 MB). Peak memory consumption was 275.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:26:33,711 INFO L168 Benchmark]: Witness Printer took 3.30 ms. Allocated memory is still 1.1 GB. Free memory is still 779.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:26:33,713 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -128.3 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 176.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1481.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 779.9 MB in the end (delta: 275.7 MB). Peak memory consumption was 275.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.30 ms. Allocated memory is still 1.1 GB. Free memory is still 779.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 18 could not be translated for associated CType STRUCT~~A?p~*VOID# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT~~A?p~*VOID# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1476]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1476. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L1465] struct A a6; VAL [\old(a6)=null, \old(a6)=null, \old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, a6={13:0}, ldv_global_msg_list={14:0}] [L1477] CALL entry_point() VAL [a6={13:0}, ldv_global_msg_list={14:0}] [L1469] CALL, EXPR probe1_6(&a6) VAL [a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}] [L1443] int ret = - -3; VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={13:0}, ldv_global_msg_list={14:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={12:0}, a6={13:0}, ldv_global_msg_list={14:0}, malloc(size)={12:0}, size=4] [L1444] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, ldv_malloc(sizeof(int))={12:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, p={12:0}, ret=3] [L1447] CALL, EXPR f6() VAL [a6={13:0}, ldv_global_msg_list={14:0}] [L1435] return __VERIFIER_nondet_int(); [L1447] RET, EXPR f6() VAL [a={13:0}, a={13:0}, a6={13:0}, f6()=0, ldv_global_msg_list={14:0}, p={12:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, p={12:0}, ret=0] [L1450] CALL, EXPR g6() VAL [a6={13:0}, ldv_global_msg_list={14:0}] [L1439] return __VERIFIER_nondet_int(); [L1450] RET, EXPR g6() VAL [a={13:0}, a={13:0}, a6={13:0}, g6()=0, ldv_global_msg_list={14:0}, p={12:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, p={12:0}, ret=0] [L1453] a->p = p VAL [a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, p={12:0}, ret=0] [L1454] return 0; VAL [\result=0, a={13:0}, a={13:0}, a6={13:0}, ldv_global_msg_list={14:0}, p={12:0}, ret=0] [L1469] RET, EXPR probe1_6(&a6) VAL [a6={13:0}, ldv_global_msg_list={14:0}, probe1_6(&a6)=0] [L1469] int ret = probe1_6(&a6); [L1470] COND TRUE ret==0 VAL [a6={13:0}, ldv_global_msg_list={14:0}, ret=0] [L1471] FCALL disconnect_2_6(&a6) VAL [a6={13:0}, ldv_global_msg_list={14:0}, ret=0] [L1473] a6.p = 0 VAL [a6={13:0}, ldv_global_msg_list={14:0}, ret=0] [L1477] RET entry_point() VAL [a6={13:0}, ldv_global_msg_list={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 53 locations, 7 error locations. UNSAFE Result, 1.4s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 485 SDtfs, 365 SDslu, 926 SDs, 0 SdLazy, 515 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 39 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 26229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:26:35,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:26:35,033 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:26:35,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:26:35,039 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:26:35,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:26:35,040 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:26:35,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:26:35,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:26:35,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:26:35,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:26:35,043 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:26:35,044 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:26:35,044 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:26:35,045 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:26:35,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:26:35,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:26:35,046 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:26:35,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:26:35,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:26:35,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:26:35,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:26:35,050 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:26:35,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:26:35,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:26:35,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:26:35,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:26:35,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:26:35,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:26:35,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:26:35,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:26:35,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:26:35,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:26:35,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:26:35,054 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:26:35,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:26:35,055 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 01:26:35,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:26:35,063 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:26:35,063 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:26:35,063 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:26:35,063 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:26:35,063 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:26:35,064 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:26:35,064 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:26:35,064 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:26:35,064 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:26:35,064 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:26:35,064 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:26:35,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:26:35,065 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:26:35,065 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:26:35,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:26:35,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:26:35,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:26:35,065 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:26:35,065 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:26:35,065 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:26:35,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:26:35,066 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 01:26:35,066 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 01:26:35,066 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:26:35,066 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:26:35,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:26:35,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:26:35,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:26:35,067 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:26:35,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:26:35,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:26:35,067 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:26:35,067 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 01:26:35,067 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:26:35,067 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 01:26:35,067 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_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db24912fd6b7f93a8f38fa3f07abfebcff2c46e9 [2018-12-09 01:26:35,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:26:35,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:26:35,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:26:35,096 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:26:35,096 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:26:35,096 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-09 01:26:35,132 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/data/9635f64ac/19ee6d3fb30d47a9aaaf8a19be32e27b/FLAGc7fc4ac7e [2018-12-09 01:26:35,498 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:26:35,498 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-09 01:26:35,506 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/data/9635f64ac/19ee6d3fb30d47a9aaaf8a19be32e27b/FLAGc7fc4ac7e [2018-12-09 01:26:35,861 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/data/9635f64ac/19ee6d3fb30d47a9aaaf8a19be32e27b [2018-12-09 01:26:35,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:26:35,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:26:35,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:26:35,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:26:35,872 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:26:35,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:26:35" (1/1) ... [2018-12-09 01:26:35,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e5a7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:35, skipping insertion in model container [2018-12-09 01:26:35,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:26:35" (1/1) ... [2018-12-09 01:26:35,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:26:35,912 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:26:36,109 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:26:36,152 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:26:36,186 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:26:36,219 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:26:36,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36 WrapperNode [2018-12-09 01:26:36,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:26:36,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:26:36,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:26:36,220 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:26:36,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36" (1/1) ... [2018-12-09 01:26:36,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36" (1/1) ... [2018-12-09 01:26:36,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:26:36,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:26:36,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:26:36,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:26:36,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36" (1/1) ... [2018-12-09 01:26:36,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36" (1/1) ... [2018-12-09 01:26:36,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36" (1/1) ... [2018-12-09 01:26:36,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36" (1/1) ... [2018-12-09 01:26:36,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36" (1/1) ... [2018-12-09 01:26:36,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36" (1/1) ... [2018-12-09 01:26:36,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36" (1/1) ... [2018-12-09 01:26:36,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:26:36,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:26:36,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:26:36,259 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:26:36,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/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 01:26:36,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:26:36,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 01:26:36,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 01:26:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:26:36,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:26:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:26:36,290 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:26:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:26:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2018-12-09 01:26:36,290 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2018-12-09 01:26:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2018-12-09 01:26:36,290 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2018-12-09 01:26:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-12-09 01:26:36,290 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-12-09 01:26:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:26:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 01:26:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 01:26:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 01:26:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:26:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:26:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-12-09 01:26:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-12-09 01:26:36,457 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:26:36,458 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 01:26:36,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:26:36 BoogieIcfgContainer [2018-12-09 01:26:36,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:26:36,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:26:36,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:26:36,460 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:26:36,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:26:35" (1/3) ... [2018-12-09 01:26:36,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83c57b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:26:36, skipping insertion in model container [2018-12-09 01:26:36,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:26:36" (2/3) ... [2018-12-09 01:26:36,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83c57b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:26:36, skipping insertion in model container [2018-12-09 01:26:36,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:26:36" (3/3) ... [2018-12-09 01:26:36,462 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-12-09 01:26:36,467 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:26:36,471 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-09 01:26:36,480 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-09 01:26:36,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:26:36,494 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:26:36,494 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:26:36,494 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:26:36,494 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:26:36,494 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:26:36,494 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:26:36,494 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:26:36,494 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:26:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-09 01:26:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:26:36,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:36,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:36,509 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:26:36,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash -387705796, now seen corresponding path program 1 times [2018-12-09 01:26:36,515 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:26:36,515 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/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 01:26:36,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:36,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:26:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:36,621 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:26:36,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:36,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:26:36,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:26:36,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:26:36,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:36,635 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2018-12-09 01:26:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:36,682 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-12-09 01:26:36,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:26:36,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 01:26:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:36,692 INFO L225 Difference]: With dead ends: 72 [2018-12-09 01:26:36,692 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 01:26:36,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 01:26:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2018-12-09 01:26:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 01:26:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-12-09 01:26:36,721 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2018-12-09 01:26:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:36,721 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-12-09 01:26:36,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:26:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-12-09 01:26:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:26:36,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:36,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:36,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:26:36,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:36,723 INFO L82 PathProgramCache]: Analyzing trace with hash -584219301, now seen corresponding path program 1 times [2018-12-09 01:26:36,723 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:26:36,723 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/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 01:26:36,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:36,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:26:36,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 01:26:36,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:36,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 01:26:36,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:36,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:36,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 01:26:36,836 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:26:36,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 01:26:36,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:36,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:26:36,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:26:36,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 01:26:36,938 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:12, output treesize:44 [2018-12-09 01:26:36,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:26:36,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:36,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:36,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-09 01:26:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:36,970 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:26:36,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:36,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:26:36,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:26:36,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:26:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:26:36,973 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-12-09 01:26:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:37,118 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-12-09 01:26:37,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:26:37,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 01:26:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:37,120 INFO L225 Difference]: With dead ends: 88 [2018-12-09 01:26:37,120 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 01:26:37,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 01:26:37,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-12-09 01:26:37,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 01:26:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-12-09 01:26:37,130 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 20 [2018-12-09 01:26:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:37,130 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-12-09 01:26:37,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:26:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-12-09 01:26:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:26:37,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:37,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:37,132 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:26:37,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:37,133 INFO L82 PathProgramCache]: Analyzing trace with hash -584219300, now seen corresponding path program 1 times [2018-12-09 01:26:37,133 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:26:37,133 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/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 01:26:37,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:37,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:26:37,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:26:37,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:37,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 01:26:37,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:26:37,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:26:37,231 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 01:26:37,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:24 [2018-12-09 01:26:37,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:26:37,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:37,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:37,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 01:26:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:37,271 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:26:37,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:37,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:26:37,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:26:37,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:26:37,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:26:37,274 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 4 states. [2018-12-09 01:26:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:37,368 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-12-09 01:26:37,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:26:37,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 01:26:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:37,369 INFO L225 Difference]: With dead ends: 106 [2018-12-09 01:26:37,369 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 01:26:37,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 01:26:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-12-09 01:26:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-09 01:26:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-12-09 01:26:37,375 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 20 [2018-12-09 01:26:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:37,375 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-12-09 01:26:37,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:26:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-12-09 01:26:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 01:26:37,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:37,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:37,376 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:26:37,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:37,376 INFO L82 PathProgramCache]: Analyzing trace with hash -400934782, now seen corresponding path program 1 times [2018-12-09 01:26:37,376 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:26:37,376 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/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 01:26:37,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:37,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:26:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:37,430 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:26:37,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:37,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:26:37,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:26:37,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:26:37,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:26:37,432 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 5 states. [2018-12-09 01:26:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:37,454 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-12-09 01:26:37,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:26:37,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 01:26:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:37,456 INFO L225 Difference]: With dead ends: 86 [2018-12-09 01:26:37,456 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 01:26:37,456 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 01:26:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 01:26:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-09 01:26:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 01:26:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-12-09 01:26:37,461 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 22 [2018-12-09 01:26:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:37,461 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-12-09 01:26:37,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:26:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-12-09 01:26:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:26:37,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:37,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:37,462 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:26:37,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash 455923737, now seen corresponding path program 1 times [2018-12-09 01:26:37,462 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:26:37,463 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:26:37,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:37,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:26:37,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:26:37,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:37,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:37,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:26:37,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:37,563 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:26:37,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:37,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:26:37,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:26:37,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:26:37,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:26:37,565 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 6 states. [2018-12-09 01:26:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:37,716 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-12-09 01:26:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:26:37,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-09 01:26:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:37,718 INFO L225 Difference]: With dead ends: 89 [2018-12-09 01:26:37,718 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 01:26:37,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:26:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 01:26:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-12-09 01:26:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 01:26:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-12-09 01:26:37,722 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 23 [2018-12-09 01:26:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:37,722 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-12-09 01:26:37,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:26:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-12-09 01:26:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:26:37,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:37,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:37,723 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:26:37,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:37,723 INFO L82 PathProgramCache]: Analyzing trace with hash 162520730, now seen corresponding path program 1 times [2018-12-09 01:26:37,724 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:26:37,724 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/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 01:26:37,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:37,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:26:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:37,775 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:26:37,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:37,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:26:37,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:26:37,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:26:37,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:26:37,776 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-12-09 01:26:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:37,806 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-09 01:26:37,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:26:37,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-09 01:26:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:37,808 INFO L225 Difference]: With dead ends: 77 [2018-12-09 01:26:37,808 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 01:26:37,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:26:37,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 01:26:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-09 01:26:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 01:26:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-12-09 01:26:37,811 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 23 [2018-12-09 01:26:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:37,811 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-12-09 01:26:37,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:26:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-12-09 01:26:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 01:26:37,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:37,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:37,812 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:26:37,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:37,812 INFO L82 PathProgramCache]: Analyzing trace with hash -389142984, now seen corresponding path program 1 times [2018-12-09 01:26:37,812 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:26:37,812 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:26:37,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:37,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:26:37,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 01:26:37,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:37,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 01:26:37,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:37,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:37,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 01:26:37,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:26:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 01:26:37,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:37,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:26:37,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:26:37,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 01:26:37,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:12, output treesize:44 [2018-12-09 01:26:38,678 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 01:26:38,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:38,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:38,685 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 01:26:38,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:38,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:38,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-09 01:26:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:38,784 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:26:38,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:38,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:26:38,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:26:38,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:26:38,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2018-12-09 01:26:38,786 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-12-09 01:26:39,203 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 01:26:39,474 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 01:26:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:39,692 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-12-09 01:26:39,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:26:39,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-09 01:26:39,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:39,693 INFO L225 Difference]: With dead ends: 79 [2018-12-09 01:26:39,693 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 01:26:39,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=60, Invalid=125, Unknown=1, NotChecked=24, Total=210 [2018-12-09 01:26:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 01:26:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-12-09 01:26:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 01:26:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-12-09 01:26:39,697 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 28 [2018-12-09 01:26:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:39,697 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-12-09 01:26:39,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:26:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-12-09 01:26:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 01:26:39,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:39,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:39,698 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:26:39,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:39,698 INFO L82 PathProgramCache]: Analyzing trace with hash -389142983, now seen corresponding path program 1 times [2018-12-09 01:26:39,699 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:26:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/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 01:26:39,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:39,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:26:39,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 01:26:39,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:39,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 01:26:39,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 01:26:39,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:39,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:39,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:39,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 01:26:39,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 01:26:39,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:26:39,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:26:39,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:26:39,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:39,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 01:26:39,949 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 01:26:39,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:26:39,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-12-09 01:26:39,998 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:25, output treesize:143 [2018-12-09 01:26:41,447 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 01:26:41,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:41,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-12-09 01:26:41,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:41,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:41,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:41,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-12-09 01:26:41,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:41,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:41,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-12-09 01:26:41,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:41,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:41,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:41,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-09 01:26:41,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 01:26:41,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:41,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:41,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:41,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-12-09 01:26:41,770 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:41,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:41,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:41,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-09 01:26:41,832 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:41,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:26:41,913 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:93, output treesize:40 [2018-12-09 01:26:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:42,030 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:26:42,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:42,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:26:42,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:26:42,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:26:42,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=39, Unknown=1, NotChecked=12, Total=72 [2018-12-09 01:26:42,033 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 9 states. [2018-12-09 01:26:42,314 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-09 01:26:45,468 WARN L180 SmtUtils]: Spent 873.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-12-09 01:26:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:47,105 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-12-09 01:26:47,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:26:47,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-09 01:26:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:47,106 INFO L225 Difference]: With dead ends: 76 [2018-12-09 01:26:47,106 INFO L226 Difference]: Without dead ends: 59 [2018-12-09 01:26:47,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=59, Invalid=125, Unknown=2, NotChecked=24, Total=210 [2018-12-09 01:26:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-09 01:26:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-12-09 01:26:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 01:26:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-12-09 01:26:47,110 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 28 [2018-12-09 01:26:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:47,110 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-12-09 01:26:47,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:26:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-12-09 01:26:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 01:26:47,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:47,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:47,112 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:26:47,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:47,112 INFO L82 PathProgramCache]: Analyzing trace with hash -956170858, now seen corresponding path program 1 times [2018-12-09 01:26:47,112 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:26:47,112 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/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 01:26:47,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:47,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:26:47,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 01:26:47,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:47,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 01:26:47,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 01:26:47,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:47,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:47,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:47,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 01:26:47,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 01:26:47,231 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:26:47,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:26:47,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 01:26:47,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:12, output treesize:44 [2018-12-09 01:26:47,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:26:47,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:47,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:47,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-09 01:26:47,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:47,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-12-09 01:26:47,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:47,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:47,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-12-09 01:26:47,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:47,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:26:47,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-12-09 01:26:47,838 WARN L854 $PredicateComparison]: unable to prove that (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| probe1_6_~p~0.base)) (not (= probe1_6_~p~0.base (_ bv0 32))) (= |c_#valid| (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1))))) is different from true [2018-12-09 01:26:47,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:47,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:47,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 01:26:47,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:47,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:47,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:16 [2018-12-09 01:26:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:26:48,051 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:26:48,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:26:48,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 01:26:48,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:26:48,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:26:48,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=81, Unknown=1, NotChecked=18, Total=132 [2018-12-09 01:26:48,053 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 12 states. [2018-12-09 01:26:57,425 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-12-09 01:27:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:27:01,596 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-09 01:27:01,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:27:01,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-09 01:27:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:27:01,597 INFO L225 Difference]: With dead ends: 57 [2018-12-09 01:27:01,597 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 01:27:01,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2018-12-09 01:27:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 01:27:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-09 01:27:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 01:27:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-12-09 01:27:01,599 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 28 [2018-12-09 01:27:01,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:27:01,600 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-12-09 01:27:01,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:27:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-12-09 01:27:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 01:27:01,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:27:01,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:27:01,600 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:27:01,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:27:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash -956170857, now seen corresponding path program 1 times [2018-12-09 01:27:01,601 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:27:01,601 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:27:01,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:27:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:27:01,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:27:01,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 01:27:01,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:01,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 01:27:01,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:01,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:01,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 01:27:01,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:27:01,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 01:27:01,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:01,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:27:01,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:27:01,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:27:01,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:01,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 01:27:01,842 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 01:27:01,854 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:27:01,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-12-09 01:27:01,884 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:25, output treesize:143 [2018-12-09 01:27:01,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-09 01:27:01,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:01,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:01,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:01,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 20 treesize of output 14 [2018-12-09 01:27:01,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:02,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-09 01:27:02,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:02,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:02,053 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:69, output treesize:10 [2018-12-09 01:27:03,840 WARN L180 SmtUtils]: Spent 961.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-09 01:27:03,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:27:03,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:03,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:27:03,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:03,856 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 01:27:03,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:3 [2018-12-09 01:27:05,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 47 [2018-12-09 01:27:05,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 01:27:05,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-12-09 01:27:05,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:05,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-12-09 01:27:05,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:05,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-09 01:27:05,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:05,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,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 27 treesize of output 21 [2018-12-09 01:27:05,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:05,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-09 01:27:05,415 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:05,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:05,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-12-09 01:27:05,478 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:05,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:27:05,539 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:91, output treesize:40 [2018-12-09 01:27:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:27:07,112 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:27:07,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:27:07,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:27:07,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:27:07,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:27:07,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=23, Unknown=3, NotChecked=0, Total=42 [2018-12-09 01:27:07,115 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 7 states. [2018-12-09 01:27:14,776 WARN L180 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-09 01:27:21,002 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 01:27:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:27:29,918 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-12-09 01:27:29,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:27:29,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-09 01:27:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:27:29,918 INFO L225 Difference]: With dead ends: 53 [2018-12-09 01:27:29,919 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 01:27:29,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=40, Invalid=61, Unknown=9, NotChecked=0, Total=110 [2018-12-09 01:27:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 01:27:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 01:27:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 01:27:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-09 01:27:29,920 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 28 [2018-12-09 01:27:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:27:29,920 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-09 01:27:29,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:27:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-09 01:27:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 01:27:29,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:27:29,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:27:29,921 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:27:29,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:27:29,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1235066613, now seen corresponding path program 1 times [2018-12-09 01:27:29,921 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:27:29,921 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/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 01:27:29,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:27:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:27:29,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:27:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:27:29,972 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:27:29,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:27:29,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:27:29,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:27:29,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:27:29,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:27:29,974 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 5 states. [2018-12-09 01:27:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:27:29,978 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-12-09 01:27:29,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:27:29,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-09 01:27:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:27:29,979 INFO L225 Difference]: With dead ends: 42 [2018-12-09 01:27:29,979 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 01:27:29,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:27:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 01:27:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 01:27:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 01:27:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-12-09 01:27:29,981 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 37 [2018-12-09 01:27:29,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:27:29,981 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-12-09 01:27:29,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:27:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-12-09 01:27:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 01:27:29,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:27:29,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:27:29,982 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:27:29,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:27:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1878309586, now seen corresponding path program 1 times [2018-12-09 01:27:29,982 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:27:29,982 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c817d04a-0368-4cd0-a58e-f2dc8fcd5bb3/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:27:30,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:27:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:27:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:27:30,173 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 01:27:30,183 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 01:27:30,189 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-09 01:27:30,189 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-09 01:27:30,189 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 01:27:30,190 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 01:27:30,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:27:30 BoogieIcfgContainer [2018-12-09 01:27:30,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:27:30,196 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:27:30,196 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:27:30,197 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:27:30,197 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:26:36" (3/4) ... [2018-12-09 01:27:30,199 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 01:27:30,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:27:30,200 INFO L168 Benchmark]: Toolchain (without parser) took 54335.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 127.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:27:30,200 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 01:27:30,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:27:30,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.23 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 01:27:30,200 INFO L168 Benchmark]: Boogie Preprocessor took 17.13 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 01:27:30,200 INFO L168 Benchmark]: RCFGBuilder took 199.64 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:27:30,201 INFO L168 Benchmark]: TraceAbstraction took 53737.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.4 MB). Peak memory consumption was 128.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:27:30,201 INFO L168 Benchmark]: Witness Printer took 2.70 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:27:30,202 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 352.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.23 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 17.13 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 199.64 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53737.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.4 MB). Peak memory consumption was 128.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.70 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~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: 1476]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1476. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L1465] struct A a6; VAL [\old(a6)=null, \old(a6)=null, \old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, a6={3:0}, ldv_global_msg_list={1:0}] [L1477] CALL entry_point() VAL [a6={3:0}, ldv_global_msg_list={1:0}] [L1469] CALL, EXPR probe1_6(&a6) VAL [a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}] [L1443] int ret = - -3; VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={3:0}, ldv_global_msg_list={1:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={2:0}, a6={3:0}, ldv_global_msg_list={1:0}, malloc(size)={2:0}, size=4] [L1444] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(int))={2:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=3] [L1447] CALL, EXPR f6() VAL [a6={3:0}, ldv_global_msg_list={1:0}] [L1435] return __VERIFIER_nondet_int(); [L1447] RET, EXPR f6() VAL [a={3:0}, a={3:0}, a6={3:0}, f6()=0, ldv_global_msg_list={1:0}, p={2:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1450] CALL, EXPR g6() VAL [a6={3:0}, ldv_global_msg_list={1:0}] [L1439] return __VERIFIER_nondet_int(); [L1450] RET, EXPR g6() VAL [a={3:0}, a={3:0}, a6={3:0}, g6()=0, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1453] a->p = p VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1454] return 0; VAL [\result=0, a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1469] RET, EXPR probe1_6(&a6) VAL [a6={3:0}, ldv_global_msg_list={1:0}, probe1_6(&a6)=0] [L1469] int ret = probe1_6(&a6); [L1470] COND TRUE ret==0 VAL [a6={3:0}, ldv_global_msg_list={1:0}, ret=0] [L1471] FCALL disconnect_2_6(&a6) VAL [a6={3:0}, ldv_global_msg_list={1:0}, ret=0] [L1473] a6.p = 0 VAL [a6={3:0}, ldv_global_msg_list={1:0}, ret=0] [L1477] RET entry_point() VAL [a6={3:0}, ldv_global_msg_list={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 53 locations, 7 error locations. UNSAFE Result, 53.7s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 42.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 568 SDtfs, 545 SDslu, 1147 SDs, 0 SdLazy, 761 SolverSat, 215 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 22.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 202 SyntacticMatches, 14 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 28.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 266 ConstructedInterpolants, 47 QuantifiedInterpolants, 57118 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1177 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...