./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13fe1afeee88065faace0f9ad16456f5e678cf43 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 11:49:32,881 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 11:49:32,882 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 11:49:32,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 11:49:32,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 11:49:32,888 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 11:49:32,889 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 11:49:32,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 11:49:32,891 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 11:49:32,891 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 11:49:32,892 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 11:49:32,892 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 11:49:32,893 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 11:49:32,893 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 11:49:32,894 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 11:49:32,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 11:49:32,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 11:49:32,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 11:49:32,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 11:49:32,897 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 11:49:32,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 11:49:32,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 11:49:32,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 11:49:32,900 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 11:49:32,900 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 11:49:32,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 11:49:32,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 11:49:32,902 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 11:49:32,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 11:49:32,903 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 11:49:32,903 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 11:49:32,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 11:49:32,903 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 11:49:32,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 11:49:32,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 11:49:32,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 11:49:32,905 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 11:49:32,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 11:49:32,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 11:49:32,913 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 11:49:32,913 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 11:49:32,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 11:49:32,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 11:49:32,913 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 11:49:32,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 11:49:32,914 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 11:49:32,914 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 11:49:32,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 11:49:32,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 11:49:32,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 11:49:32,914 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 11:49:32,914 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 11:49:32,914 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 11:49:32,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 11:49:32,914 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 11:49:32,914 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 11:49:32,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 11:49:32,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 11:49:32,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 11:49:32,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 11:49:32,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 11:49:32,915 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 11:49:32,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 11:49:32,915 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 11:49:32,915 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 11:49:32,915 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_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13fe1afeee88065faace0f9ad16456f5e678cf43 [2018-12-08 11:49:32,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 11:49:32,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 11:49:32,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 11:49:32,943 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 11:49:32,943 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 11:49:32,944 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-12-08 11:49:32,988 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/data/dc8da749c/97e0bbe19b564bddb14608209895c431/FLAG90b147fbc [2018-12-08 11:49:33,425 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 11:49:33,426 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-12-08 11:49:33,431 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/data/dc8da749c/97e0bbe19b564bddb14608209895c431/FLAG90b147fbc [2018-12-08 11:49:33,439 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/data/dc8da749c/97e0bbe19b564bddb14608209895c431 [2018-12-08 11:49:33,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 11:49:33,442 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 11:49:33,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 11:49:33,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 11:49:33,445 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 11:49:33,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:49:33" (1/1) ... [2018-12-08 11:49:33,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ef7631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:49:33, skipping insertion in model container [2018-12-08 11:49:33,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:49:33" (1/1) ... [2018-12-08 11:49:33,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 11:49:33,468 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 11:49:33,607 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:49:33,613 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 11:49:33,676 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:49:33,694 INFO L195 MainTranslator]: Completed translation [2018-12-08 11:49:33,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:49:33 WrapperNode [2018-12-08 11:49:33,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 11:49:33,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 11:49:33,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 11:49:33,695 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 11:49:33,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:49:33" (1/1) ... [2018-12-08 11:49:33,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:49:33" (1/1) ... [2018-12-08 11:49:33,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:49:33" (1/1) ... [2018-12-08 11:49:33,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:49:33" (1/1) ... [2018-12-08 11:49:33,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:49:33" (1/1) ... [2018-12-08 11:49:33,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:49:33" (1/1) ... [2018-12-08 11:49:33,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:49:33" (1/1) ... [2018-12-08 11:49:33,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 11:49:33,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 11:49:33,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 11:49:33,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 11:49:33,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:49:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 11:49:33,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 11:49:33,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 11:49:33,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 11:49:33,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 11:49:33,757 INFO L138 BoogieDeclarations]: Found implementation of procedure lis [2018-12-08 11:49:33,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 11:49:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 11:49:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 11:49:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 11:49:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 11:49:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 11:49:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 11:49:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 11:49:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 11:49:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 11:49:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 11:49:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 11:49:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure lis [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 11:49:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 11:49:34,013 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 11:49:34,013 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 11:49:34,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:49:34 BoogieIcfgContainer [2018-12-08 11:49:34,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 11:49:34,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 11:49:34,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 11:49:34,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 11:49:34,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 11:49:33" (1/3) ... [2018-12-08 11:49:34,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31aa94c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:49:34, skipping insertion in model container [2018-12-08 11:49:34,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:49:33" (2/3) ... [2018-12-08 11:49:34,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31aa94c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:49:34, skipping insertion in model container [2018-12-08 11:49:34,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:49:34" (3/3) ... [2018-12-08 11:49:34,018 INFO L112 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-12-08 11:49:34,024 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 11:49:34,028 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-12-08 11:49:34,037 INFO L257 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2018-12-08 11:49:34,052 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 11:49:34,052 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 11:49:34,052 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 11:49:34,052 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 11:49:34,052 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 11:49:34,052 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 11:49:34,053 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 11:49:34,053 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 11:49:34,053 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 11:49:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-12-08 11:49:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 11:49:34,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:34,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:34,069 INFO L423 AbstractCegarLoop]: === Iteration 1 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:34,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:34,072 INFO L82 PathProgramCache]: Analyzing trace with hash 881745875, now seen corresponding path program 1 times [2018-12-08 11:49:34,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:34,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:34,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:34,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:34,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:49:34,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 11:49:34,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:49:34,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:49:34,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:49:34,188 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2018-12-08 11:49:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:34,249 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-12-08 11:49:34,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:49:34,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 11:49:34,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:34,257 INFO L225 Difference]: With dead ends: 62 [2018-12-08 11:49:34,257 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 11:49:34,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:49:34,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 11:49:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-08 11:49:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-08 11:49:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-12-08 11:49:34,282 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 12 [2018-12-08 11:49:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:34,283 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-12-08 11:49:34,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:49:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-12-08 11:49:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 11:49:34,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:34,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:34,284 INFO L423 AbstractCegarLoop]: === Iteration 2 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:34,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:34,284 INFO L82 PathProgramCache]: Analyzing trace with hash 881745876, now seen corresponding path program 1 times [2018-12-08 11:49:34,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:34,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:34,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:34,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:34,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:49:34,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:49:34,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:49:34,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:49:34,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:49:34,353 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2018-12-08 11:49:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:34,443 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-12-08 11:49:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:49:34,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-12-08 11:49:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:34,444 INFO L225 Difference]: With dead ends: 65 [2018-12-08 11:49:34,444 INFO L226 Difference]: Without dead ends: 65 [2018-12-08 11:49:34,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:49:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-08 11:49:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-12-08 11:49:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-08 11:49:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-12-08 11:49:34,448 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 12 [2018-12-08 11:49:34,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:34,448 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-12-08 11:49:34,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:49:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-12-08 11:49:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 11:49:34,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:34,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:34,449 INFO L423 AbstractCegarLoop]: === Iteration 3 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:34,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:34,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1564318347, now seen corresponding path program 1 times [2018-12-08 11:49:34,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:34,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:34,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:34,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:34,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:49:34,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 11:49:34,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:49:34,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:49:34,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:49:34,469 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 3 states. [2018-12-08 11:49:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:34,491 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-12-08 11:49:34,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:49:34,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 11:49:34,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:34,492 INFO L225 Difference]: With dead ends: 59 [2018-12-08 11:49:34,492 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 11:49:34,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:49:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 11:49:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-08 11:49:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-08 11:49:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-12-08 11:49:34,496 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 13 [2018-12-08 11:49:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:34,496 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-12-08 11:49:34,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:49:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-12-08 11:49:34,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 11:49:34,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:34,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:34,497 INFO L423 AbstractCegarLoop]: === Iteration 4 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:34,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:34,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1564318348, now seen corresponding path program 1 times [2018-12-08 11:49:34,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:34,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:34,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:34,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:34,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:49:34,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:49:34,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:49:34,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:49:34,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:49:34,538 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 5 states. [2018-12-08 11:49:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:34,629 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-12-08 11:49:34,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:49:34,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-08 11:49:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:34,630 INFO L225 Difference]: With dead ends: 75 [2018-12-08 11:49:34,630 INFO L226 Difference]: Without dead ends: 75 [2018-12-08 11:49:34,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12-08 11:49:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-08 11:49:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2018-12-08 11:49:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 11:49:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-12-08 11:49:34,633 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-12-08 11:49:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:34,634 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-12-08 11:49:34,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:49:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-12-08 11:49:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 11:49:34,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:34,634 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:34,634 INFO L423 AbstractCegarLoop]: === Iteration 5 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:34,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:34,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2082251687, now seen corresponding path program 1 times [2018-12-08 11:49:34,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:34,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:34,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:49:34,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/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-12-08 11:49:34,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:34,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:49:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:34,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:49:34,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-12-08 11:49:34,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 11:49:34,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 11:49:34,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:49:34,749 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 9 states. [2018-12-08 11:49:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:34,888 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-12-08 11:49:34,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:49:34,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-08 11:49:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:34,891 INFO L225 Difference]: With dead ends: 86 [2018-12-08 11:49:34,891 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 11:49:34,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:49:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 11:49:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2018-12-08 11:49:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-08 11:49:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-12-08 11:49:34,895 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 16 [2018-12-08 11:49:34,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:34,895 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-12-08 11:49:34,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 11:49:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-12-08 11:49:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 11:49:34,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:34,895 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:34,895 INFO L423 AbstractCegarLoop]: === Iteration 6 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:34,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:34,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1819688599, now seen corresponding path program 1 times [2018-12-08 11:49:34,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:34,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:34,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:49:34,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/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-12-08 11:49:34,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:34,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:49:35,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-08 11:49:35,007 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 16 treesize of output 19 [2018-12-08 11:49:35,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:49:35,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:49:35,023 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 5 treesize of output 1 [2018-12-08 11:49:35,023 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:49:35,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:49:35,029 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:28, output treesize:25 [2018-12-08 11:49:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:35,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:49:35,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-12-08 11:49:35,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 11:49:35,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 11:49:35,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:49:35,102 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 9 states. [2018-12-08 11:49:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:35,213 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2018-12-08 11:49:35,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:49:35,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-08 11:49:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:35,215 INFO L225 Difference]: With dead ends: 89 [2018-12-08 11:49:35,215 INFO L226 Difference]: Without dead ends: 89 [2018-12-08 11:49:35,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-08 11:49:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-08 11:49:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-12-08 11:49:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-08 11:49:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-12-08 11:49:35,219 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 16 [2018-12-08 11:49:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:35,219 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-12-08 11:49:35,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 11:49:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-12-08 11:49:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 11:49:35,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:35,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:35,220 INFO L423 AbstractCegarLoop]: === Iteration 7 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:35,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:35,220 INFO L82 PathProgramCache]: Analyzing trace with hash -735692276, now seen corresponding path program 1 times [2018-12-08 11:49:35,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:35,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:35,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:35,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:35,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:35,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:49:35,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:49:35,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:49:35,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:49:35,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:49:35,265 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 7 states. [2018-12-08 11:49:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:35,302 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2018-12-08 11:49:35,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:49:35,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-08 11:49:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:35,303 INFO L225 Difference]: With dead ends: 76 [2018-12-08 11:49:35,303 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 11:49:35,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:49:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 11:49:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-08 11:49:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 11:49:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-12-08 11:49:35,308 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 19 [2018-12-08 11:49:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:35,308 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-12-08 11:49:35,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:49:35,308 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-12-08 11:49:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 11:49:35,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:35,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:35,309 INFO L423 AbstractCegarLoop]: === Iteration 8 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:35,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash -735692275, now seen corresponding path program 1 times [2018-12-08 11:49:35,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:35,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:35,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:35,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:35,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:35,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:49:35,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/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-12-08 11:49:35,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:35,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:49:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:35,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:49:35,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-08 11:49:35,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:49:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:49:35,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:49:35,402 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 8 states. [2018-12-08 11:49:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:35,496 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-12-08 11:49:35,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:49:35,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-08 11:49:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:35,496 INFO L225 Difference]: With dead ends: 136 [2018-12-08 11:49:35,497 INFO L226 Difference]: Without dead ends: 136 [2018-12-08 11:49:35,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-08 11:49:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-08 11:49:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2018-12-08 11:49:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 11:49:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2018-12-08 11:49:35,501 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 19 [2018-12-08 11:49:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:35,501 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2018-12-08 11:49:35,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:49:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2018-12-08 11:49:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 11:49:35,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:35,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:35,502 INFO L423 AbstractCegarLoop]: === Iteration 9 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:35,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:35,502 INFO L82 PathProgramCache]: Analyzing trace with hash -320521474, now seen corresponding path program 1 times [2018-12-08 11:49:35,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:35,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:35,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:35,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:35,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:35,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:49:35,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:49:35,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:49:35,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:49:35,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:49:35,540 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 5 states. [2018-12-08 11:49:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:35,579 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-12-08 11:49:35,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:49:35,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-08 11:49:35,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:35,580 INFO L225 Difference]: With dead ends: 97 [2018-12-08 11:49:35,580 INFO L226 Difference]: Without dead ends: 97 [2018-12-08 11:49:35,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:49:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-08 11:49:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2018-12-08 11:49:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-08 11:49:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-12-08 11:49:35,583 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 20 [2018-12-08 11:49:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:35,584 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-12-08 11:49:35,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:49:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-12-08 11:49:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 11:49:35,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:35,585 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:35,585 INFO L423 AbstractCegarLoop]: === Iteration 10 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:35,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:35,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1027097368, now seen corresponding path program 2 times [2018-12-08 11:49:35,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:35,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:35,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:35,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:35,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:35,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:49:35,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/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-12-08 11:49:35,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:49:35,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:49:35,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:49:35,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:49:35,748 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-12-08 11:49:35,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:49:35,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 11:49:35,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:49:35,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:49:35,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-12-08 11:49:35,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:49:35,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:49:35,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:49:35,800 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-12-08 11:49:35,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:49:35,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 11:49:35,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-08 11:49:35,819 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:49:35,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:49:35,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 11:49:35,834 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:45, output treesize:40 [2018-12-08 11:49:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:49:35,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:49:35,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2018-12-08 11:49:35,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 11:49:35,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 11:49:35,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-08 11:49:35,931 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 14 states. [2018-12-08 11:49:36,712 WARN L180 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2018-12-08 11:49:37,178 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-12-08 11:49:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:37,498 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-12-08 11:49:37,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 11:49:37,498 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-12-08 11:49:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:37,499 INFO L225 Difference]: With dead ends: 125 [2018-12-08 11:49:37,500 INFO L226 Difference]: Without dead ends: 125 [2018-12-08 11:49:37,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2018-12-08 11:49:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-08 11:49:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 84. [2018-12-08 11:49:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-08 11:49:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2018-12-08 11:49:37,503 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 23 [2018-12-08 11:49:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:37,503 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2018-12-08 11:49:37,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 11:49:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2018-12-08 11:49:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 11:49:37,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:37,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:37,504 INFO L423 AbstractCegarLoop]: === Iteration 11 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:37,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:37,504 INFO L82 PathProgramCache]: Analyzing trace with hash 794265272, now seen corresponding path program 1 times [2018-12-08 11:49:37,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:37,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:37,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:37,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:49:37,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:37,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:49:37,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:49:37,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:37,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:49:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 11:49:37,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:49:37,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-08 11:49:37,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 11:49:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 11:49:37,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 11:49:37,595 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand 10 states. [2018-12-08 11:49:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:37,697 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2018-12-08 11:49:37,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:49:37,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-08 11:49:37,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:37,698 INFO L225 Difference]: With dead ends: 90 [2018-12-08 11:49:37,698 INFO L226 Difference]: Without dead ends: 90 [2018-12-08 11:49:37,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-12-08 11:49:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-08 11:49:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2018-12-08 11:49:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-08 11:49:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-12-08 11:49:37,701 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 24 [2018-12-08 11:49:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:37,701 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-12-08 11:49:37,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 11:49:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-12-08 11:49:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 11:49:37,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:37,702 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:37,702 INFO L423 AbstractCegarLoop]: === Iteration 12 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:37,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:37,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1775247340, now seen corresponding path program 1 times [2018-12-08 11:49:37,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:37,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:37,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:37,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:37,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:49:37,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:49:37,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:49:37,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:49:37,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:49:37,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:49:37,743 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 8 states. [2018-12-08 11:49:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:37,831 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2018-12-08 11:49:37,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:49:37,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-08 11:49:37,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:37,832 INFO L225 Difference]: With dead ends: 114 [2018-12-08 11:49:37,832 INFO L226 Difference]: Without dead ends: 114 [2018-12-08 11:49:37,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:49:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-08 11:49:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2018-12-08 11:49:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-08 11:49:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2018-12-08 11:49:37,834 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 24 [2018-12-08 11:49:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:37,835 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2018-12-08 11:49:37,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:49:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-12-08 11:49:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 11:49:37,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:37,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:37,835 INFO L423 AbstractCegarLoop]: === Iteration 13 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:37,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:37,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1947880059, now seen corresponding path program 1 times [2018-12-08 11:49:37,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:37,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:37,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:37,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:37,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:38,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:49:38,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:49:38,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:38,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:49:38,122 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 5 treesize of output 1 [2018-12-08 11:49:38,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:49:38,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:49:38,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-08 11:49:38,145 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 15 treesize of output 12 [2018-12-08 11:49:38,146 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 12 treesize of output 11 [2018-12-08 11:49:38,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:49:38,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:49:38,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:49:38,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-08 11:49:38,173 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-12-08 11:49:38,175 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-12-08 11:49:38,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:49:38,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:49:38,187 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-12-08 11:49:38,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-12-08 11:49:38,230 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-12-08 11:49:38,231 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-12-08 11:49:38,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:49:38,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 11:49:38,235 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:49:38,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:49:38,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:49:38,238 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-12-08 11:49:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:49:38,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:49:38,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-12-08 11:49:38,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 11:49:38,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 11:49:38,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-12-08 11:49:38,268 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 17 states. [2018-12-08 11:49:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:39,219 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2018-12-08 11:49:39,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-08 11:49:39,219 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-08 11:49:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:39,220 INFO L225 Difference]: With dead ends: 182 [2018-12-08 11:49:39,220 INFO L226 Difference]: Without dead ends: 182 [2018-12-08 11:49:39,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2018-12-08 11:49:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-08 11:49:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 92. [2018-12-08 11:49:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-08 11:49:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-12-08 11:49:39,224 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 28 [2018-12-08 11:49:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:39,224 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-12-08 11:49:39,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 11:49:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-12-08 11:49:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 11:49:39,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:39,226 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:39,226 INFO L423 AbstractCegarLoop]: === Iteration 14 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:39,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:39,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1012493537, now seen corresponding path program 1 times [2018-12-08 11:49:39,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:39,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:39,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:39,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:49:39,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:49:39,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 11:49:39,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:49:39,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:49:39,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:49:39,243 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 3 states. [2018-12-08 11:49:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:39,247 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-12-08 11:49:39,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:49:39,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 11:49:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:39,248 INFO L225 Difference]: With dead ends: 93 [2018-12-08 11:49:39,248 INFO L226 Difference]: Without dead ends: 93 [2018-12-08 11:49:39,248 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-12-08 11:49:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-08 11:49:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-08 11:49:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-08 11:49:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-12-08 11:49:39,250 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 28 [2018-12-08 11:49:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:39,250 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-12-08 11:49:39,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:49:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2018-12-08 11:49:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 11:49:39,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:39,251 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:39,251 INFO L423 AbstractCegarLoop]: === Iteration 15 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:39,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:39,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1012484506, now seen corresponding path program 1 times [2018-12-08 11:49:39,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:39,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:49:39,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:49:39,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:49:39,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:49:39,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:49:39,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:49:39,323 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 8 states. [2018-12-08 11:49:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:39,388 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-12-08 11:49:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:49:39,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-08 11:49:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:39,389 INFO L225 Difference]: With dead ends: 92 [2018-12-08 11:49:39,389 INFO L226 Difference]: Without dead ends: 92 [2018-12-08 11:49:39,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:49:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-08 11:49:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-12-08 11:49:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 11:49:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-12-08 11:49:39,391 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 28 [2018-12-08 11:49:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:39,391 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-12-08 11:49:39,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:49:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-12-08 11:49:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 11:49:39,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:39,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:39,392 INFO L423 AbstractCegarLoop]: === Iteration 16 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:39,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:39,392 INFO L82 PathProgramCache]: Analyzing trace with hash -167985506, now seen corresponding path program 1 times [2018-12-08 11:49:39,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:39,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:39,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:39,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 11:49:39,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:49:39,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:49:39,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:49:39,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:49:39,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:49:39,462 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 6 states. [2018-12-08 11:49:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:39,503 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2018-12-08 11:49:39,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:49:39,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-08 11:49:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:39,503 INFO L225 Difference]: With dead ends: 90 [2018-12-08 11:49:39,503 INFO L226 Difference]: Without dead ends: 42 [2018-12-08 11:49:39,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:49:39,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-08 11:49:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-08 11:49:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-08 11:49:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-08 11:49:39,504 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2018-12-08 11:49:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:39,505 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-08 11:49:39,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:49:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-08 11:49:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 11:49:39,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:39,505 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 11:49:39,505 INFO L423 AbstractCegarLoop]: === Iteration 17 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:39,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:39,505 INFO L82 PathProgramCache]: Analyzing trace with hash -348897415, now seen corresponding path program 1 times [2018-12-08 11:49:39,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:39,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:39,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:39,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:49:39,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:49:39,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 11:49:39,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:49:39,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:49:39,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:49:39,540 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 8 states. [2018-12-08 11:49:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:39,615 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-12-08 11:49:39,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:49:39,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-12-08 11:49:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:39,616 INFO L225 Difference]: With dead ends: 59 [2018-12-08 11:49:39,616 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 11:49:39,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:49:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 11:49:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-08 11:49:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 11:49:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-12-08 11:49:39,618 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 31 [2018-12-08 11:49:39,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:39,618 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-12-08 11:49:39,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:49:39,618 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-12-08 11:49:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 11:49:39,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:39,619 INFO L402 BasicCegarLoop]: trace histogram [2, 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] [2018-12-08 11:49:39,619 INFO L423 AbstractCegarLoop]: === Iteration 18 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:39,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:39,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1854760848, now seen corresponding path program 1 times [2018-12-08 11:49:39,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:39,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:39,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:39,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:49:39,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:49:39,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:49:39,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:39,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:49:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 11:49:39,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:49:39,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2018-12-08 11:49:39,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 11:49:39,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 11:49:39,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:49:39,721 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 12 states. [2018-12-08 11:49:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:39,854 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-12-08 11:49:39,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 11:49:39,854 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-12-08 11:49:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:39,855 INFO L225 Difference]: With dead ends: 74 [2018-12-08 11:49:39,855 INFO L226 Difference]: Without dead ends: 74 [2018-12-08 11:49:39,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-08 11:49:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-08 11:49:39,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2018-12-08 11:49:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 11:49:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-12-08 11:49:39,856 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 34 [2018-12-08 11:49:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:39,856 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-12-08 11:49:39,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 11:49:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-12-08 11:49:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 11:49:39,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:39,857 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:39,857 INFO L423 AbstractCegarLoop]: === Iteration 19 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:39,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash 235322773, now seen corresponding path program 2 times [2018-12-08 11:49:39,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:39,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:39,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:49:39,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 11:49:39,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:49:39,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:49:39,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:49:39,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 11:49:39,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:49:39,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:49:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 11:49:39,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:49:39,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-12-08 11:49:39,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 11:49:39,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 11:49:39,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-12-08 11:49:39,994 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 16 states. [2018-12-08 11:49:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:40,148 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-12-08 11:49:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 11:49:40,148 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-08 11:49:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:40,149 INFO L225 Difference]: With dead ends: 107 [2018-12-08 11:49:40,149 INFO L226 Difference]: Without dead ends: 87 [2018-12-08 11:49:40,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2018-12-08 11:49:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-08 11:49:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 62. [2018-12-08 11:49:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-08 11:49:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-12-08 11:49:40,151 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 41 [2018-12-08 11:49:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:40,151 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-12-08 11:49:40,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 11:49:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-12-08 11:49:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 11:49:40,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:49:40,151 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:49:40,152 INFO L423 AbstractCegarLoop]: === Iteration 20 === [lisErr16REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 11:49:40,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:49:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2044143056, now seen corresponding path program 3 times [2018-12-08 11:49:40,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:49:40,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:49:40,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:40,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:49:40,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:49:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:49:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 11:49:40,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:49:40,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:49:40,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 11:49:40,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-08 11:49:40,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:49:40,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:49:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 11:49:40,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:49:40,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2018-12-08 11:49:40,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 11:49:40,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 11:49:40,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-08 11:49:40,310 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 13 states. [2018-12-08 11:49:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:49:40,413 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-12-08 11:49:40,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 11:49:40,413 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-12-08 11:49:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:49:40,413 INFO L225 Difference]: With dead ends: 73 [2018-12-08 11:49:40,413 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 11:49:40,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-08 11:49:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 11:49:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 11:49:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 11:49:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 11:49:40,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-12-08 11:49:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:49:40,414 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 11:49:40,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 11:49:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 11:49:40,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 11:49:40,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 11:49:40 BoogieIcfgContainer [2018-12-08 11:49:40,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 11:49:40,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 11:49:40,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 11:49:40,418 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 11:49:40,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:49:34" (3/4) ... [2018-12-08 11:49:40,420 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 11:49:40,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 11:49:40,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lis [2018-12-08 11:49:40,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-08 11:49:40,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-08 11:49:40,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 11:49:40,428 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-08 11:49:40,428 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-08 11:49:40,428 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 11:49:40,469 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cea27174-a599-4672-80c8-32efe81a4813/bin-2019/uautomizer/witness.graphml [2018-12-08 11:49:40,469 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 11:49:40,469 INFO L168 Benchmark]: Toolchain (without parser) took 7027.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Free memory was 957.1 MB in the beginning and 1.3 GB in the end (delta: -295.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:49:40,470 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:49:40,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-08 11:49:40,470 INFO L168 Benchmark]: Boogie Preprocessor took 29.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-08 11:49:40,471 INFO L168 Benchmark]: RCFGBuilder took 289.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2018-12-08 11:49:40,471 INFO L168 Benchmark]: TraceAbstraction took 6402.98 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -211.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:49:40,471 INFO L168 Benchmark]: Witness Printer took 51.36 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-12-08 11:49:40,473 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 289.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6402.98 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -211.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 51.36 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 75 locations, 23 error locations. SAFE Result, 6.3s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 762 SDtfs, 2659 SDslu, 2012 SDs, 0 SdLazy, 2281 SolverSat, 258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 232 SyntacticMatches, 7 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=14, 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, 20 MinimizatonAttempts, 304 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 722 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 693 ConstructedInterpolants, 28 QuantifiedInterpolants, 117525 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1107 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 29 InterpolantComputations, 16 PerfectInterpolantSequences, 151/193 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...