./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a74485b04ec8988328f8bc8f67ebe898d81e7141 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:26:04,718 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:26:04,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:26:04,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:26:04,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:26:04,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:26:04,727 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:26:04,728 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:26:04,730 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:26:04,730 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:26:04,731 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:26:04,731 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:26:04,732 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:26:04,732 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:26:04,733 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:26:04,733 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:26:04,734 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:26:04,735 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:26:04,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:26:04,738 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:26:04,738 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:26:04,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:26:04,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:26:04,741 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:26:04,741 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:26:04,742 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:26:04,743 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:26:04,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:26:04,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:26:04,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:26:04,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:26:04,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:26:04,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:26:04,745 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:26:04,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:26:04,747 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:26:04,747 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-11-28 12:26:04,757 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:26:04,757 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:26:04,758 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:26:04,758 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:26:04,758 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:26:04,758 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:26:04,759 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:26:04,759 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:26:04,759 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:26:04,759 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:26:04,759 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:26:04,759 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:26:04,759 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:26:04,759 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 12:26:04,759 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 12:26:04,759 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:26:04,760 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:26:04,760 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:26:04,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:26:04,760 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:26:04,760 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:26:04,760 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:26:04,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:26:04,761 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:26:04,761 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:26:04,761 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:26:04,761 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:26:04,761 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_a69f356e-b560-481e-9ffb-dffe00ed8d23/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-memcleanup) ) 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 -> a74485b04ec8988328f8bc8f67ebe898d81e7141 [2018-11-28 12:26:04,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:26:04,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:26:04,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:26:04,795 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:26:04,795 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:26:04,796 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-28 12:26:04,833 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/data/c7408ae1c/fd13cd62f8c6418a872ce42d4f33fc38/FLAG204bcbe75 [2018-11-28 12:26:05,292 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:26:05,292 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-28 12:26:05,302 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/data/c7408ae1c/fd13cd62f8c6418a872ce42d4f33fc38/FLAG204bcbe75 [2018-11-28 12:26:05,311 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/data/c7408ae1c/fd13cd62f8c6418a872ce42d4f33fc38 [2018-11-28 12:26:05,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:26:05,314 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 12:26:05,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:26:05,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:26:05,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:26:05,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:26:05" (1/1) ... [2018-11-28 12:26:05,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8662d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:05, skipping insertion in model container [2018-11-28 12:26:05,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:26:05" (1/1) ... [2018-11-28 12:26:05,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:26:05,346 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:26:05,525 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:26:05,532 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:26:05,599 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:26:05,623 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:26:05,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:05 WrapperNode [2018-11-28 12:26:05,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:26:05,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:26:05,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:26:05,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:26:05,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:05" (1/1) ... [2018-11-28 12:26:05,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:05" (1/1) ... [2018-11-28 12:26:05,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:05" (1/1) ... [2018-11-28 12:26:05,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:05" (1/1) ... [2018-11-28 12:26:05,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:05" (1/1) ... [2018-11-28 12:26:05,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:05" (1/1) ... [2018-11-28 12:26:05,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:05" (1/1) ... [2018-11-28 12:26:05,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:26:05,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:26:05,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:26:05,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:26:05,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/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-11-28 12:26:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:26:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:26:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 12:26:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:26:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 12:26:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 12:26:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 12:26:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 12:26:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 12:26:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 12:26:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 12:26:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 12:26:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 12:26:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 12:26:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 12:26:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 12:26:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 12:26:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 12:26:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 12:26:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 12:26:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 12:26:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 12:26:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 12:26:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 12:26:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 12:26:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 12:26:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 12:26:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 12:26:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 12:26:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 12:26:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 12:26:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 12:26:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 12:26:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 12:26:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 12:26:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 12:26:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 12:26:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 12:26:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 12:26:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 12:26:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 12:26:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 12:26:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 12:26:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 12:26:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 12:26:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 12:26:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 12:26:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 12:26:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 12:26:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 12:26:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 12:26:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 12:26:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 12:26:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 12:26:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 12:26:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 12:26:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 12:26:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 12:26:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 12:26:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 12:26:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 12:26:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 12:26:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 12:26:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 12:26:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 12:26:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 12:26:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 12:26:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 12:26:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 12:26:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 12:26:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 12:26:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 12:26:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 12:26:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 12:26:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 12:26:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 12:26:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 12:26:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 12:26:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 12:26:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 12:26:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 12:26:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 12:26:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 12:26:05,713 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 12:26:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 12:26:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 12:26:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 12:26:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 12:26:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 12:26:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 12:26:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 12:26:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 12:26:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 12:26:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 12:26:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 12:26:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 12:26:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 12:26:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 12:26:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 12:26:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 12:26:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 12:26:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 12:26:05,715 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 12:26:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 12:26:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 12:26:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 12:26:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 12:26:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 12:26:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:26:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:26:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:26:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 12:26:05,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 12:26:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:26:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:26:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:26:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:26:06,062 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:26:06,062 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 12:26:06,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:06 BoogieIcfgContainer [2018-11-28 12:26:06,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:26:06,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:26:06,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:26:06,066 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:26:06,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:26:05" (1/3) ... [2018-11-28 12:26:06,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205927b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:26:06, skipping insertion in model container [2018-11-28 12:26:06,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:05" (2/3) ... [2018-11-28 12:26:06,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205927b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:26:06, skipping insertion in model container [2018-11-28 12:26:06,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:06" (3/3) ... [2018-11-28 12:26:06,068 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-28 12:26:06,074 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:26:06,079 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-11-28 12:26:06,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2018-11-28 12:26:06,103 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:26:06,104 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:26:06,104 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 12:26:06,104 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:26:06,104 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:26:06,104 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:26:06,104 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:26:06,104 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:26:06,104 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:26:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-28 12:26:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:26:06,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:06,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:06,123 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:06,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:06,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1038621538, now seen corresponding path program 1 times [2018-11-28 12:26:06,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:06,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:06,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:06,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:06,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:06,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:26:06,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 12:26:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:26:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:26:06,228 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-11-28 12:26:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:06,243 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-11-28 12:26:06,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:26:06,244 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 12:26:06,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:06,251 INFO L225 Difference]: With dead ends: 76 [2018-11-28 12:26:06,251 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 12:26:06,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:26:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 12:26:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 12:26:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 12:26:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-28 12:26:06,277 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 10 [2018-11-28 12:26:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:06,277 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-28 12:26:06,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 12:26:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-28 12:26:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 12:26:06,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:06,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:06,278 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:06,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532259, now seen corresponding path program 1 times [2018-11-28 12:26:06,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:06,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:06,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:06,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:06,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:06,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:26:06,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:26:06,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:26:06,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:26:06,335 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-11-28 12:26:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:06,484 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-11-28 12:26:06,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:26:06,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 12:26:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:06,486 INFO L225 Difference]: With dead ends: 85 [2018-11-28 12:26:06,486 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 12:26:06,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:26:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 12:26:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-11-28 12:26:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 12:26:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-11-28 12:26:06,493 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 11 [2018-11-28 12:26:06,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:06,493 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-11-28 12:26:06,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:26:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-28 12:26:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 12:26:06,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:06,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:06,494 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:06,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:06,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532258, now seen corresponding path program 1 times [2018-11-28 12:26:06,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:06,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:06,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:06,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:06,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:06,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:26:06,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:26:06,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:26:06,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:26:06,531 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 4 states. [2018-11-28 12:26:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:06,639 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-11-28 12:26:06,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:26:06,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 12:26:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:06,640 INFO L225 Difference]: With dead ends: 93 [2018-11-28 12:26:06,641 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 12:26:06,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:26:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 12:26:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-11-28 12:26:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 12:26:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-11-28 12:26:06,646 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 11 [2018-11-28 12:26:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:06,646 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-11-28 12:26:06,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:26:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-28 12:26:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 12:26:06,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:06,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:06,647 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:06,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:06,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1219409795, now seen corresponding path program 1 times [2018-11-28 12:26:06,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:06,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:06,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:06,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:06,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:06,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:26:06,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:26:06,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:26:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:26:06,726 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 5 states. [2018-11-28 12:26:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:06,826 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-11-28 12:26:06,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:26:06,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 12:26:06,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:06,827 INFO L225 Difference]: With dead ends: 122 [2018-11-28 12:26:06,827 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 12:26:06,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:26:06,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 12:26:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2018-11-28 12:26:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 12:26:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-11-28 12:26:06,832 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 20 [2018-11-28 12:26:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:06,833 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-11-28 12:26:06,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:26:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-11-28 12:26:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 12:26:06,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:06,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:06,834 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:06,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:06,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1219362099, now seen corresponding path program 1 times [2018-11-28 12:26:06,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:06,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:06,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:06,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:06,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:06,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:26:06,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:26:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:26:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:26:06,875 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 5 states. [2018-11-28 12:26:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:06,945 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-11-28 12:26:06,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:26:06,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 12:26:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:06,947 INFO L225 Difference]: With dead ends: 116 [2018-11-28 12:26:06,947 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 12:26:06,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:26:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 12:26:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-11-28 12:26:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 12:26:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2018-11-28 12:26:06,954 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 20 [2018-11-28 12:26:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:06,954 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2018-11-28 12:26:06,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:26:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2018-11-28 12:26:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 12:26:06,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:06,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:06,955 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:06,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:06,956 INFO L82 PathProgramCache]: Analyzing trace with hash 48910251, now seen corresponding path program 1 times [2018-11-28 12:26:06,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:06,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:06,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:06,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:06,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:06,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:26:06,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:26:06,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:26:06,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:26:06,978 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 3 states. [2018-11-28 12:26:06,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:06,986 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-11-28 12:26:06,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:26:06,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 12:26:06,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:06,988 INFO L225 Difference]: With dead ends: 159 [2018-11-28 12:26:06,988 INFO L226 Difference]: Without dead ends: 159 [2018-11-28 12:26:06,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 12:26:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-28 12:26:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 120. [2018-11-28 12:26:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-28 12:26:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2018-11-28 12:26:06,995 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 20 [2018-11-28 12:26:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:06,995 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2018-11-28 12:26:06,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:26:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2018-11-28 12:26:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 12:26:06,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:06,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:06,997 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:06,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash -246914379, now seen corresponding path program 1 times [2018-11-28 12:26:06,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:06,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:06,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:06,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:06,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:07,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:07,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:26:07,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:26:07,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:26:07,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:26:07,041 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand 6 states. [2018-11-28 12:26:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:07,141 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-11-28 12:26:07,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:26:07,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-28 12:26:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:07,143 INFO L225 Difference]: With dead ends: 127 [2018-11-28 12:26:07,143 INFO L226 Difference]: Without dead ends: 127 [2018-11-28 12:26:07,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:26:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-28 12:26:07,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2018-11-28 12:26:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 12:26:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-11-28 12:26:07,147 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 20 [2018-11-28 12:26:07,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:07,147 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-11-28 12:26:07,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:26:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-11-28 12:26:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:26:07,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:07,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:07,152 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:07,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:07,153 INFO L82 PathProgramCache]: Analyzing trace with hash 854480748, now seen corresponding path program 1 times [2018-11-28 12:26:07,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:07,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:07,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:07,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:07,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:07,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:07,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:26:07,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:26:07,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:26:07,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:26:07,203 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 6 states. [2018-11-28 12:26:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:07,309 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-11-28 12:26:07,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:26:07,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 12:26:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:07,310 INFO L225 Difference]: With dead ends: 108 [2018-11-28 12:26:07,310 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 12:26:07,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:26:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 12:26:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-11-28 12:26:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 12:26:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-11-28 12:26:07,314 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 21 [2018-11-28 12:26:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:07,315 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-11-28 12:26:07,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:26:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-11-28 12:26:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:26:07,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:07,315 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:07,316 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:07,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash -810428214, now seen corresponding path program 1 times [2018-11-28 12:26:07,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:07,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:07,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:07,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:07,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:07,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:07,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:26:07,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:26:07,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:26:07,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:26:07,368 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-11-28 12:26:07,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:07,474 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2018-11-28 12:26:07,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:26:07,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 12:26:07,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:07,475 INFO L225 Difference]: With dead ends: 103 [2018-11-28 12:26:07,475 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 12:26:07,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:26:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 12:26:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-11-28 12:26:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 12:26:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-11-28 12:26:07,478 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 21 [2018-11-28 12:26:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:07,479 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-11-28 12:26:07,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:26:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-11-28 12:26:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:26:07,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:07,480 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:07,480 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:07,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:07,480 INFO L82 PathProgramCache]: Analyzing trace with hash -810428213, now seen corresponding path program 1 times [2018-11-28 12:26:07,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:07,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:07,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:07,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:07,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:07,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:07,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:26:07,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:26:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:26:07,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:26:07,539 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 6 states. [2018-11-28 12:26:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:07,689 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-11-28 12:26:07,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:26:07,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 12:26:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:07,690 INFO L225 Difference]: With dead ends: 112 [2018-11-28 12:26:07,690 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 12:26:07,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:26:07,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 12:26:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2018-11-28 12:26:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 12:26:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-11-28 12:26:07,693 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 21 [2018-11-28 12:26:07,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:07,693 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-11-28 12:26:07,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:26:07,693 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-11-28 12:26:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:26:07,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:07,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:07,694 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:07,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:07,694 INFO L82 PathProgramCache]: Analyzing trace with hash 719099552, now seen corresponding path program 1 times [2018-11-28 12:26:07,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:07,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:07,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:07,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:07,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:07,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:07,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:26:07,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:26:07,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:26:07,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:26:07,750 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-11-28 12:26:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:07,863 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-11-28 12:26:07,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:26:07,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-28 12:26:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:07,864 INFO L225 Difference]: With dead ends: 105 [2018-11-28 12:26:07,864 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 12:26:07,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:26:07,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 12:26:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2018-11-28 12:26:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 12:26:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-11-28 12:26:07,866 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 22 [2018-11-28 12:26:07,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:07,866 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-11-28 12:26:07,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:26:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-11-28 12:26:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:26:07,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:07,867 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 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-11-28 12:26:07,867 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:07,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:07,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1968452048, now seen corresponding path program 1 times [2018-11-28 12:26:07,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:07,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:07,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:07,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:07,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:07,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:08,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:08,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:08,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:26:08,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:26:08,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:08,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:08,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-11-28 12:26:08,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:08,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:08,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:26:08,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-11-28 12:26:08,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:26:08,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:08,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:26:08,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:08,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:26:08,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-11-28 12:26:08,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 12:26:08,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 12:26:08,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-11-28 12:26:08,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 12:26:08,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:08,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:08,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-28 12:26:08,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 12:26:08,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:26:08,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 12:26:08,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:08,528 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-28 12:26:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:08,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:08,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-11-28 12:26:08,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:26:08,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:26:08,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:26:08,561 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 21 states. [2018-11-28 12:26:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:09,022 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2018-11-28 12:26:09,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 12:26:09,023 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-28 12:26:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:09,024 INFO L225 Difference]: With dead ends: 179 [2018-11-28 12:26:09,024 INFO L226 Difference]: Without dead ends: 179 [2018-11-28 12:26:09,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2018-11-28 12:26:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-28 12:26:09,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 96. [2018-11-28 12:26:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 12:26:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-11-28 12:26:09,027 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2018-11-28 12:26:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:09,027 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-11-28 12:26:09,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:26:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-11-28 12:26:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:26:09,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:09,028 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 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-11-28 12:26:09,029 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:09,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash -995956632, now seen corresponding path program 1 times [2018-11-28 12:26:09,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:09,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:09,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:09,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:09,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:09,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:09,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:09,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:09,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:09,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:26:09,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:26:09,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:09,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:09,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 12:26:09,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:09,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:09,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:26:09,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-11-28 12:26:09,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:26:09,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:09,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:26:09,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:26:09,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:09,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-11-28 12:26:09,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 12:26:09,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 12:26:09,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-11-28 12:26:09,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 12:26:09,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:09,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:09,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-11-28 12:26:09,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 12:26:09,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 12:26:09,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:26:09,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:09,447 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-28 12:26:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:09,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:09,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 12:26:09,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:26:09,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:26:09,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:26:09,473 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 21 states. [2018-11-28 12:26:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:09,964 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-11-28 12:26:09,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 12:26:09,965 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-28 12:26:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:09,966 INFO L225 Difference]: With dead ends: 133 [2018-11-28 12:26:09,966 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 12:26:09,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 12:26:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 12:26:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2018-11-28 12:26:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 12:26:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-11-28 12:26:09,969 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 30 [2018-11-28 12:26:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:09,969 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-11-28 12:26:09,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:26:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-11-28 12:26:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 12:26:09,970 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:09,970 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 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-11-28 12:26:09,970 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:09,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1031908765, now seen corresponding path program 1 times [2018-11-28 12:26:09,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:09,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:09,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:09,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:09,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:10,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:10,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:10,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:10,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:10,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:26:10,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:26:10,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:10,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:10,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-11-28 12:26:10,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:26:10,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-11-28 12:26:10,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:26:10,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:10,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:26:10,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:26:10,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-11-28 12:26:10,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 12:26:10,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 12:26:10,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2018-11-28 12:26:10,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 12:26:10,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:10,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-28 12:26:10,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:26:10,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-11-28 12:26:10,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:26:10,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:10,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 12:26:10,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:26:10,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-11-28 12:26:10,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 12:26:10,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 12:26:10,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:10,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2018-11-28 12:26:10,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-11-28 12:26:10,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-28 12:26:10,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-28 12:26:10,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:26:10,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:26:10,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-28 12:26:10,677 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:37, output treesize:56 [2018-11-28 12:26:10,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 12:26:10,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:26:10,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 12:26:10,757 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,762 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-28 12:26:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:10,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:10,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2018-11-28 12:26:10,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-28 12:26:10,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-28 12:26:10,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2018-11-28 12:26:10,795 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 31 states. [2018-11-28 12:26:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:11,499 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-11-28 12:26:11,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 12:26:11,499 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-11-28 12:26:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:11,500 INFO L225 Difference]: With dead ends: 92 [2018-11-28 12:26:11,500 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 12:26:11,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=386, Invalid=2064, Unknown=0, NotChecked=0, Total=2450 [2018-11-28 12:26:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 12:26:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-11-28 12:26:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 12:26:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-11-28 12:26:11,503 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 40 [2018-11-28 12:26:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:11,504 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-11-28 12:26:11,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-28 12:26:11,504 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-28 12:26:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 12:26:11,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:11,505 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 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-11-28 12:26:11,505 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION]=== [2018-11-28 12:26:11,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2004404181, now seen corresponding path program 1 times [2018-11-28 12:26:11,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:11,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:11,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:11,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:11,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:11,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:11,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:11,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:26:11,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:26:11,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:11,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:11,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 12:26:11,861 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 12:26:11,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-11-28 12:26:11,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:26:11,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:26:11,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:26:11,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:11,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2018-11-28 12:26:11,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-28 12:26:11,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-11-28 12:26:11,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:28 [2018-11-28 12:26:12,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 12:26:12,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:12,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-11-28 12:26:12,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:12,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:12,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:12,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 12:26:12,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-11-28 12:26:12,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:26:12,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:12,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 12:26:12,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:12,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:26:12,097 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:45 [2018-11-28 12:26:12,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-28 12:26:12,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-11-28 12:26:12,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:12,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:33 [2018-11-28 12:26:12,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-28 12:26:12,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:12,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:12,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-11-28 12:26:12,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-11-28 12:26:12,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:26:12,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:26:12,282 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 12:26:12,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:12,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:47, output treesize:3 [2018-11-28 12:26:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:12,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:12,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-11-28 12:26:12,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-28 12:26:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-28 12:26:12,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2018-11-28 12:26:12,324 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 30 states. [2018-11-28 12:26:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:13,235 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-28 12:26:13,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 12:26:13,235 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-11-28 12:26:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:13,236 INFO L225 Difference]: With dead ends: 79 [2018-11-28 12:26:13,236 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:26:13,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=558, Invalid=2748, Unknown=0, NotChecked=0, Total=3306 [2018-11-28 12:26:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:26:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:26:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:26:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:26:13,237 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-28 12:26:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:13,237 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:26:13,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-28 12:26:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:26:13,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:26:13,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:26:13 BoogieIcfgContainer [2018-11-28 12:26:13,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:26:13,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:26:13,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:26:13,241 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:26:13,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:06" (3/4) ... [2018-11-28 12:26:13,244 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:26:13,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:26:13,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 12:26:13,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:26:13,253 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 12:26:13,253 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 12:26:13,253 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:26:13,283 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a69f356e-b560-481e-9ffb-dffe00ed8d23/bin-2019/uautomizer/witness.graphml [2018-11-28 12:26:13,283 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:26:13,284 INFO L168 Benchmark]: Toolchain (without parser) took 7970.49 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 950.6 MB in the beginning and 879.6 MB in the end (delta: 71.0 MB). Peak memory consumption was 398.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:26:13,285 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:26:13,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:26:13,285 INFO L168 Benchmark]: Boogie Preprocessor took 39.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:26:13,285 INFO L168 Benchmark]: RCFGBuilder took 398.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:26:13,285 INFO L168 Benchmark]: TraceAbstraction took 7177.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 879.6 MB in the end (delta: 202.0 MB). Peak memory consumption was 383.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:26:13,286 INFO L168 Benchmark]: Witness Printer took 42.04 ms. Allocated memory is still 1.4 GB. Free memory is still 879.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:26:13,287 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 398.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7177.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 879.6 MB in the end (delta: 202.0 MB). Peak memory consumption was 383.4 MB. Max. memory is 11.5 GB. * Witness Printer took 42.04 ms. Allocated memory is still 1.4 GB. Free memory is still 879.6 MB. 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: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: 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 - PositiveResult [Line: 626]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 27 error locations. SAFE Result, 7.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 707 SDtfs, 1525 SDslu, 2490 SDs, 0 SdLazy, 3079 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2155 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 284 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 458 ConstructedInterpolants, 22 QuantifiedInterpolants, 141358 SizeOfPredicates, 65 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 11/67 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...