./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1_true-valid-memsafety_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_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6808c66573fa9f309265139cf6a41427fc3491cf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 20:29:10,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:29:10,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:29:10,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:29:10,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:29:10,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:29:10,739 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:29:10,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:29:10,741 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:29:10,741 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:29:10,742 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:29:10,742 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:29:10,743 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:29:10,743 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:29:10,744 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:29:10,744 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:29:10,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:29:10,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:29:10,746 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:29:10,747 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:29:10,747 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:29:10,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:29:10,749 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:29:10,749 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:29:10,749 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:29:10,750 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:29:10,750 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:29:10,751 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:29:10,751 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:29:10,751 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:29:10,752 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:29:10,752 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:29:10,752 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:29:10,752 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:29:10,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:29:10,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:29:10,753 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 20:29:10,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:29:10,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:29:10,761 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:29:10,761 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:29:10,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 20:29:10,761 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 20:29:10,761 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 20:29:10,761 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:29:10,761 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:29:10,762 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 20:29:10,762 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:29:10,762 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:29:10,762 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:29:10,762 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 20:29:10,762 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 20:29:10,762 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 20:29:10,762 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:29:10,762 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:29:10,762 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 20:29:10,762 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:29:10,763 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:29:10,763 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:29:10,763 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:29:10,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:29:10,763 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:29:10,763 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:29:10,763 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 20:29:10,763 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:29:10,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6808c66573fa9f309265139cf6a41427fc3491cf [2018-12-02 20:29:10,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:29:10,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:29:10,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:29:10,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:29:10,790 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:29:10,790 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2018-12-02 20:29:10,824 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/data/c55c827f9/d4b41a7df5e74f7aba06a45d2c899e16/FLAG8ba32be3e [2018-12-02 20:29:11,273 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:29:11,273 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/sv-benchmarks/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2018-12-02 20:29:11,280 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/data/c55c827f9/d4b41a7df5e74f7aba06a45d2c899e16/FLAG8ba32be3e [2018-12-02 20:29:11,288 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/data/c55c827f9/d4b41a7df5e74f7aba06a45d2c899e16 [2018-12-02 20:29:11,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:29:11,290 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 20:29:11,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:29:11,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:29:11,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:29:11,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:29:11" (1/1) ... [2018-12-02 20:29:11,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7014c445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:29:11, skipping insertion in model container [2018-12-02 20:29:11,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:29:11" (1/1) ... [2018-12-02 20:29:11,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:29:11,317 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:29:11,454 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:29:11,461 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:29:11,517 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:29:11,540 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:29:11,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:29:11 WrapperNode [2018-12-02 20:29:11,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:29:11,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:29:11,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:29:11,540 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:29:11,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:29:11" (1/1) ... [2018-12-02 20:29:11,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:29:11" (1/1) ... [2018-12-02 20:29:11,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:29:11" (1/1) ... [2018-12-02 20:29:11,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:29:11" (1/1) ... [2018-12-02 20:29:11,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:29:11" (1/1) ... [2018-12-02 20:29:11,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:29:11" (1/1) ... [2018-12-02 20:29:11,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:29:11" (1/1) ... [2018-12-02 20:29:11,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:29:11,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:29:11,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:29:11,569 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:29:11,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:29:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:29:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 20:29:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:29:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-12-02 20:29:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-12-02 20:29:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 20:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 20:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 20:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 20:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 20:29:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 20:29:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 20:29:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 20:29:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 20:29:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 20:29:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 20:29:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 20:29:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 20:29:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 20:29:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 20:29:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 20:29:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 20:29:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 20:29:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 20:29:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 20:29:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 20:29:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 20:29:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 20:29:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 20:29:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 20:29:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 20:29:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 20:29:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 20:29:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 20:29:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 20:29:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 20:29:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 20:29:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 20:29:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 20:29:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 20:29:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 20:29:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 20:29:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 20:29:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 20:29:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 20:29:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-12-02 20:29:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 20:29:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 20:29:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 20:29:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 20:29:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-12-02 20:29:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 20:29:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 20:29:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 20:29:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 20:29:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:29:11,855 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:29:11,855 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 20:29:11,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:29:11 BoogieIcfgContainer [2018-12-02 20:29:11,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:29:11,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:29:11,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:29:11,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:29:11,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:29:11" (1/3) ... [2018-12-02 20:29:11,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187d3e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:29:11, skipping insertion in model container [2018-12-02 20:29:11,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:29:11" (2/3) ... [2018-12-02 20:29:11,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187d3e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:29:11, skipping insertion in model container [2018-12-02 20:29:11,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:29:11" (3/3) ... [2018-12-02 20:29:11,860 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_true-valid-memsafety_true-termination.i [2018-12-02 20:29:11,866 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:29:11,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-12-02 20:29:11,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2018-12-02 20:29:11,896 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 20:29:11,897 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:29:11,897 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 20:29:11,897 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:29:11,897 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:29:11,897 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:29:11,897 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:29:11,897 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:29:11,897 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:29:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-12-02 20:29:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 20:29:11,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:11,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:29:11,914 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:11,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:11,917 INFO L82 PathProgramCache]: Analyzing trace with hash -515788711, now seen corresponding path program 1 times [2018-12-02 20:29:11,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:11,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:11,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:11,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:11,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:12,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:12,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:29:12,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:29:12,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:29:12,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:29:12,048 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-12-02 20:29:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:12,160 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-02 20:29:12,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:29:12,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 20:29:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:12,167 INFO L225 Difference]: With dead ends: 70 [2018-12-02 20:29:12,168 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 20:29:12,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:29:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 20:29:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-02 20:29:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 20:29:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-02 20:29:12,191 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 9 [2018-12-02 20:29:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:12,191 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-02 20:29:12,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:29:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-02 20:29:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 20:29:12,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:12,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:29:12,192 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:12,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash -515788710, now seen corresponding path program 1 times [2018-12-02 20:29:12,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:12,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:12,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:12,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:12,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:12,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:12,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:29:12,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:29:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:29:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:29:12,237 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 5 states. [2018-12-02 20:29:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:12,343 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-02 20:29:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:29:12,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 20:29:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:12,344 INFO L225 Difference]: With dead ends: 64 [2018-12-02 20:29:12,345 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 20:29:12,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:29:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 20:29:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-02 20:29:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 20:29:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-02 20:29:12,350 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 9 [2018-12-02 20:29:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:12,351 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-02 20:29:12,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:29:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-02 20:29:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 20:29:12,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:12,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:29:12,352 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:12,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:12,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1751712613, now seen corresponding path program 1 times [2018-12-02 20:29:12,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:12,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:12,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:12,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:12,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:12,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:12,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:29:12,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:29:12,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:29:12,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:29:12,420 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 7 states. [2018-12-02 20:29:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:12,525 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-02 20:29:12,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:29:12,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-02 20:29:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:12,526 INFO L225 Difference]: With dead ends: 61 [2018-12-02 20:29:12,526 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 20:29:12,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:29:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 20:29:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-02 20:29:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 20:29:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-02 20:29:12,529 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 11 [2018-12-02 20:29:12,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:12,529 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-02 20:29:12,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:29:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-02 20:29:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 20:29:12,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:12,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:29:12,530 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:12,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:12,530 INFO L82 PathProgramCache]: Analyzing trace with hash 231357725, now seen corresponding path program 1 times [2018-12-02 20:29:12,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:12,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:12,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:12,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:12,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:12,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:12,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:29:12,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:29:12,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:29:12,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:29:12,581 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 5 states. [2018-12-02 20:29:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:12,652 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-02 20:29:12,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:29:12,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 20:29:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:12,653 INFO L225 Difference]: With dead ends: 60 [2018-12-02 20:29:12,653 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 20:29:12,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:29:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 20:29:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-02 20:29:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 20:29:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-02 20:29:12,656 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 13 [2018-12-02 20:29:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:12,656 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-02 20:29:12,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:29:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-02 20:29:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 20:29:12,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:12,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:29:12,657 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:12,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:12,657 INFO L82 PathProgramCache]: Analyzing trace with hash 231357726, now seen corresponding path program 1 times [2018-12-02 20:29:12,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:12,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:12,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:12,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:12,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:12,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:12,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:29:12,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:29:12,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:29:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:29:12,716 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 5 states. [2018-12-02 20:29:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:12,789 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-02 20:29:12,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:29:12,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 20:29:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:12,790 INFO L225 Difference]: With dead ends: 59 [2018-12-02 20:29:12,790 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 20:29:12,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:29:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 20:29:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-02 20:29:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 20:29:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-02 20:29:12,793 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 13 [2018-12-02 20:29:12,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:12,793 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-02 20:29:12,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:29:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-02 20:29:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 20:29:12,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:12,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:29:12,793 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:12,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1044526556, now seen corresponding path program 1 times [2018-12-02 20:29:12,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:12,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:12,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:12,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:12,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:12,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:12,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 20:29:12,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 20:29:12,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 20:29:12,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:29:12,889 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 11 states. [2018-12-02 20:29:13,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:13,072 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-02 20:29:13,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 20:29:13,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-02 20:29:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:13,073 INFO L225 Difference]: With dead ends: 58 [2018-12-02 20:29:13,073 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 20:29:13,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-02 20:29:13,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 20:29:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-02 20:29:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 20:29:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-02 20:29:13,076 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 16 [2018-12-02 20:29:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:13,077 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-02 20:29:13,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 20:29:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-02 20:29:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 20:29:13,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:13,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:29:13,078 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:13,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:13,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1044526555, now seen corresponding path program 1 times [2018-12-02 20:29:13,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:13,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:13,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:13,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:13,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 20:29:13,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 20:29:13,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 20:29:13,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:29:13,194 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 11 states. [2018-12-02 20:29:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:13,429 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-02 20:29:13,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 20:29:13,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-02 20:29:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:13,430 INFO L225 Difference]: With dead ends: 57 [2018-12-02 20:29:13,430 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 20:29:13,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-02 20:29:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 20:29:13,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 20:29:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 20:29:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-02 20:29:13,433 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 16 [2018-12-02 20:29:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:13,433 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-02 20:29:13,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 20:29:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-02 20:29:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 20:29:13,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:13,434 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] [2018-12-02 20:29:13,434 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:13,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:13,434 INFO L82 PathProgramCache]: Analyzing trace with hash 504402916, now seen corresponding path program 1 times [2018-12-02 20:29:13,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:13,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:13,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:13,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:13,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:13,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:13,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 20:29:13,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:29:13,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:29:13,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:29:13,452 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 3 states. [2018-12-02 20:29:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:13,477 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-02 20:29:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:29:13,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 20:29:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:13,478 INFO L225 Difference]: With dead ends: 53 [2018-12-02 20:29:13,478 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 20:29:13,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:29:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 20:29:13,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-02 20:29:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 20:29:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-02 20:29:13,481 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 24 [2018-12-02 20:29:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:13,481 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-02 20:29:13,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:29:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-02 20:29:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 20:29:13,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:13,482 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] [2018-12-02 20:29:13,482 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:13,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash 504402917, now seen corresponding path program 1 times [2018-12-02 20:29:13,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:13,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:13,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:13,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:13,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 20:29:13,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:29:13,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:29:13,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:29:13,505 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 3 states. [2018-12-02 20:29:13,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:13,536 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-02 20:29:13,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:29:13,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 20:29:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:13,538 INFO L225 Difference]: With dead ends: 49 [2018-12-02 20:29:13,538 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 20:29:13,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:29:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 20:29:13,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-02 20:29:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 20:29:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-02 20:29:13,541 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 24 [2018-12-02 20:29:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:13,542 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-02 20:29:13,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:29:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-02 20:29:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 20:29:13,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:13,543 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] [2018-12-02 20:29:13,543 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:13,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:13,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1229606583, now seen corresponding path program 1 times [2018-12-02 20:29:13,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:13,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:13,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:13,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:13,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:13,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:13,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 20:29:13,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 20:29:13,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 20:29:13,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-12-02 20:29:13,854 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 20 states. [2018-12-02 20:29:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:14,324 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-02 20:29:14,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 20:29:14,324 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-12-02 20:29:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:14,325 INFO L225 Difference]: With dead ends: 47 [2018-12-02 20:29:14,325 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 20:29:14,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2018-12-02 20:29:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 20:29:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-02 20:29:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 20:29:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-02 20:29:14,328 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 30 [2018-12-02 20:29:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:14,328 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-02 20:29:14,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 20:29:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-02 20:29:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 20:29:14,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:14,328 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] [2018-12-02 20:29:14,329 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:14,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:14,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1229606582, now seen corresponding path program 1 times [2018-12-02 20:29:14,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:14,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:14,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:14,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:14,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:14,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:14,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 20:29:14,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 20:29:14,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 20:29:14,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-12-02 20:29:14,651 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 19 states. [2018-12-02 20:29:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:15,889 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-02 20:29:15,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 20:29:15,889 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-12-02 20:29:15,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:15,890 INFO L225 Difference]: With dead ends: 45 [2018-12-02 20:29:15,890 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 20:29:15,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 20:29:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 20:29:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-02 20:29:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 20:29:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-02 20:29:15,894 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 30 [2018-12-02 20:29:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:15,894 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-02 20:29:15,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 20:29:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-02 20:29:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 20:29:15,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:15,895 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] [2018-12-02 20:29:15,896 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:15,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash 536901616, now seen corresponding path program 1 times [2018-12-02 20:29:15,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:15,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:15,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:15,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:15,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:16,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:16,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 20:29:16,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 20:29:16,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 20:29:16,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-12-02 20:29:16,236 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2018-12-02 20:29:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:17,104 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-02 20:29:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 20:29:17,104 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-12-02 20:29:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:17,105 INFO L225 Difference]: With dead ends: 44 [2018-12-02 20:29:17,105 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 20:29:17,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 20:29:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 20:29:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 20:29:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 20:29:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-02 20:29:17,107 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 31 [2018-12-02 20:29:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:17,107 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-02 20:29:17,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 20:29:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-02 20:29:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 20:29:17,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:17,107 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] [2018-12-02 20:29:17,107 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:17,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:17,108 INFO L82 PathProgramCache]: Analyzing trace with hash 536901617, now seen corresponding path program 1 times [2018-12-02 20:29:17,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:17,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:17,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:17,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:17,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:17,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:17,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 20:29:17,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 20:29:17,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 20:29:17,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-12-02 20:29:17,476 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-12-02 20:29:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:18,328 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-02 20:29:18,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 20:29:18,329 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2018-12-02 20:29:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:18,329 INFO L225 Difference]: With dead ends: 42 [2018-12-02 20:29:18,329 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 20:29:18,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 20:29:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 20:29:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 20:29:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 20:29:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-02 20:29:18,331 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-12-02 20:29:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:18,331 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-02 20:29:18,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 20:29:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-02 20:29:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 20:29:18,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:18,332 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] [2018-12-02 20:29:18,332 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:18,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:18,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1946772458, now seen corresponding path program 1 times [2018-12-02 20:29:18,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:18,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:18,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:18,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:18,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:19,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:19,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-12-02 20:29:19,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 20:29:19,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 20:29:19,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-12-02 20:29:19,300 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 26 states. [2018-12-02 20:29:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:20,595 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2018-12-02 20:29:20,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 20:29:20,595 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2018-12-02 20:29:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:20,595 INFO L225 Difference]: With dead ends: 44 [2018-12-02 20:29:20,595 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 20:29:20,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2018-12-02 20:29:20,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 20:29:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 20:29:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 20:29:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-12-02 20:29:20,597 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 36 [2018-12-02 20:29:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:20,597 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-12-02 20:29:20,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 20:29:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-12-02 20:29:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 20:29:20,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:20,598 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] [2018-12-02 20:29:20,598 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:20,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1946067215, now seen corresponding path program 1 times [2018-12-02 20:29:20,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:20,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:20,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:20,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:20,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:20,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:20,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-12-02 20:29:20,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 20:29:20,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 20:29:20,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-12-02 20:29:20,994 INFO L87 Difference]: Start difference. First operand 42 states and 41 transitions. Second operand 24 states. [2018-12-02 20:29:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:21,718 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2018-12-02 20:29:21,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 20:29:21,718 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2018-12-02 20:29:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:21,719 INFO L225 Difference]: With dead ends: 41 [2018-12-02 20:29:21,719 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 20:29:21,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=188, Invalid=1534, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 20:29:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 20:29:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-02 20:29:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 20:29:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 40 transitions. [2018-12-02 20:29:21,722 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 40 transitions. Word has length 36 [2018-12-02 20:29:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:21,722 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 40 transitions. [2018-12-02 20:29:21,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 20:29:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2018-12-02 20:29:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 20:29:21,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:29:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:29:21,723 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION]=== [2018-12-02 20:29:21,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:29:21,723 INFO L82 PathProgramCache]: Analyzing trace with hash -577402277, now seen corresponding path program 1 times [2018-12-02 20:29:21,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:29:21,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:29:21,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:21,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:29:21,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:29:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:29:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:29:23,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:29:23,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-12-02 20:29:23,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 20:29:23,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 20:29:23,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-12-02 20:29:23,192 INFO L87 Difference]: Start difference. First operand 41 states and 40 transitions. Second operand 26 states. [2018-12-02 20:29:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:29:24,995 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2018-12-02 20:29:24,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 20:29:24,995 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 40 [2018-12-02 20:29:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:29:24,995 INFO L225 Difference]: With dead ends: 40 [2018-12-02 20:29:24,995 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 20:29:24,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=140, Invalid=1500, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 20:29:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 20:29:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 20:29:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 20:29:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 20:29:24,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-12-02 20:29:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:29:24,997 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:29:24,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 20:29:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 20:29:24,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 20:29:25,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:29:25 BoogieIcfgContainer [2018-12-02 20:29:25,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:29:25,001 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:29:25,001 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:29:25,001 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:29:25,001 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:29:11" (3/4) ... [2018-12-02 20:29:25,004 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 20:29:25,008 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 20:29:25,008 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2018-12-02 20:29:25,008 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 20:29:25,008 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2018-12-02 20:29:25,011 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-02 20:29:25,011 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 20:29:25,011 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 20:29:25,038 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f3c17a2c-8a49-4f27-830f-21d6032d54dc/bin-2019/uautomizer/witness.graphml [2018-12-02 20:29:25,038 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:29:25,039 INFO L168 Benchmark]: Toolchain (without parser) took 13749.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 410.0 MB). Free memory was 957.0 MB in the beginning and 1.2 GB in the end (delta: -263.2 MB). Peak memory consumption was 146.8 MB. Max. memory is 11.5 GB. [2018-12-02 20:29:25,039 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:29:25,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:29:25,040 INFO L168 Benchmark]: Boogie Preprocessor took 28.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:29:25,040 INFO L168 Benchmark]: RCFGBuilder took 286.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2018-12-02 20:29:25,040 INFO L168 Benchmark]: TraceAbstraction took 13144.67 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 290.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -174.2 MB). Peak memory consumption was 116.3 MB. Max. memory is 11.5 GB. [2018-12-02 20:29:25,041 INFO L168 Benchmark]: Witness Printer took 37.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:29:25,042 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 249.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.31 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 286.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13144.67 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 290.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -174.2 MB). Peak memory consumption was 116.3 MB. Max. memory is 11.5 GB. * Witness Printer took 37.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 639]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 636]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 636]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 33 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 33 error locations. SAFE Result, 13.1s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 532 SDtfs, 512 SDslu, 2228 SDs, 0 SdLazy, 4752 SolverSat, 248 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 353 ConstructedInterpolants, 0 QuantifiedInterpolants, 205898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...