./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/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 b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/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 b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:02:46,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:02:46,883 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:02:46,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:02:46,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:02:46,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:02:46,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:02:46,894 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:02:46,896 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:02:46,896 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:02:46,897 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:02:46,897 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:02:46,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:02:46,898 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:02:46,899 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:02:46,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:02:46,900 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:02:46,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:02:46,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:02:46,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:02:46,904 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:02:46,905 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:02:46,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:02:46,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:02:46,907 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:02:46,908 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:02:46,908 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:02:46,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:02:46,910 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:02:46,910 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:02:46,911 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:02:46,912 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:02:46,912 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:02:46,912 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:02:46,912 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:02:46,913 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:02:46,913 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 13:02:46,924 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:02:46,924 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:02:46,925 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:02:46,925 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:02:46,925 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:02:46,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:02:46,926 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:02:46,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:02:46,926 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:02:46,926 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:02:46,926 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:02:46,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:02:46,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:02:46,927 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 13:02:46,927 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 13:02:46,927 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 13:02:46,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:02:46,927 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:02:46,928 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:02:46,928 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:02:46,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:02:46,930 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:02:46,930 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:02:46,930 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:02:46,930 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:02:46,930 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:02:46,930 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:02:46,930 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:02:46,931 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_9190acd9-e670-4021-bbbf-88591987037e/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 -> b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 [2018-11-28 13:02:46,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:02:46,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:02:46,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:02:46,966 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:02:46,967 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:02:46,967 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:02:47,007 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/data/aa72b7921/86fea6a33c2c4a2d959f0623baabc84b/FLAGa7a2aa25b [2018-11-28 13:02:47,387 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:02:47,387 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:02:47,396 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/data/aa72b7921/86fea6a33c2c4a2d959f0623baabc84b/FLAGa7a2aa25b [2018-11-28 13:02:47,779 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/data/aa72b7921/86fea6a33c2c4a2d959f0623baabc84b [2018-11-28 13:02:47,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:02:47,782 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 13:02:47,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:02:47,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:02:47,785 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:02:47,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23acc025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47, skipping insertion in model container [2018-11-28 13:02:47,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:02:47,816 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:02:48,000 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:02:48,009 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:02:48,077 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:02:48,103 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:02:48,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:48 WrapperNode [2018-11-28 13:02:48,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:02:48,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:02:48,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:02:48,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:02:48,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:48" (1/1) ... [2018-11-28 13:02:48,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:48" (1/1) ... [2018-11-28 13:02:48,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:48" (1/1) ... [2018-11-28 13:02:48,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:48" (1/1) ... [2018-11-28 13:02:48,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:48" (1/1) ... [2018-11-28 13:02:48,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:48" (1/1) ... [2018-11-28 13:02:48,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:48" (1/1) ... [2018-11-28 13:02:48,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:02:48,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:02:48,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:02:48,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:02:48,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:02:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:02:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:02:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 13:02:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 13:02:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-11-28 13:02:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:02:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 13:02:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 13:02:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 13:02:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 13:02:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 13:02:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 13:02:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 13:02:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 13:02:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 13:02:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 13:02:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 13:02:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 13:02:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 13:02:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 13:02:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 13:02:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 13:02:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 13:02:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 13:02:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 13:02:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 13:02:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 13:02:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 13:02:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 13:02:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 13:02:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 13:02:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 13:02:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 13:02:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 13:02:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 13:02:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 13:02:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 13:02:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 13:02:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 13:02:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 13:02:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 13:02:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 13:02:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 13:02:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 13:02:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 13:02:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 13:02:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 13:02:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 13:02:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 13:02:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 13:02:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 13:02:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 13:02:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 13:02:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 13:02:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 13:02:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 13:02:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 13:02:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 13:02:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 13:02:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 13:02:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 13:02:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 13:02:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 13:02:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 13:02:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 13:02:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 13:02:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 13:02:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 13:02:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 13:02:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 13:02:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 13:02:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 13:02:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 13:02:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 13:02:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 13:02:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 13:02:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 13:02:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 13:02:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 13:02:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 13:02:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 13:02:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 13:02:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 13:02:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 13:02:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 13:02:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 13:02:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 13:02:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 13:02:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 13:02:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 13:02:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 13:02:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 13:02:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 13:02:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 13:02:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 13:02:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-11-28 13:02:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:02:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:02:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:02:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:02:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:02:48,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:02:48,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:02:48,451 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:02:48,451 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 13:02:48,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:02:48 BoogieIcfgContainer [2018-11-28 13:02:48,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:02:48,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:02:48,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:02:48,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:02:48,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:02:47" (1/3) ... [2018-11-28 13:02:48,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5464a215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:02:48, skipping insertion in model container [2018-11-28 13:02:48,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:48" (2/3) ... [2018-11-28 13:02:48,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5464a215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:02:48, skipping insertion in model container [2018-11-28 13:02:48,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:02:48" (3/3) ... [2018-11-28 13:02:48,456 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:02:48,463 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:02:48,467 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-11-28 13:02:48,476 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-11-28 13:02:48,490 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:02:48,490 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:02:48,490 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 13:02:48,491 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:02:48,491 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:02:48,491 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:02:48,491 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:02:48,491 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:02:48,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:02:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-28 13:02:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:02:48,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:48,509 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:48,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851682, now seen corresponding path program 1 times [2018-11-28 13:02:48,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:02:48,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:02:48,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:02:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:02:48,634 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-11-28 13:02:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:48,672 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-28 13:02:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:02:48,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 13:02:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:48,680 INFO L225 Difference]: With dead ends: 36 [2018-11-28 13:02:48,680 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 13:02:48,681 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-11-28 13:02:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 13:02:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-28 13:02:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 13:02:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-28 13:02:48,703 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2018-11-28 13:02:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:48,703 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-28 13:02:48,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:02:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-28 13:02:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:02:48,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:48,704 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:48,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851683, now seen corresponding path program 1 times [2018-11-28 13:02:48,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:02:48,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:48,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:48,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:48,760 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2018-11-28 13:02:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:48,791 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-28 13:02:48,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:02:48,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 13:02:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:48,792 INFO L225 Difference]: With dead ends: 32 [2018-11-28 13:02:48,792 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 13:02:48,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 13:02:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-28 13:02:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 13:02:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-28 13:02:48,795 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 10 [2018-11-28 13:02:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:48,795 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-28 13:02:48,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-28 13:02:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:02:48,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:48,796 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:48,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172715, now seen corresponding path program 1 times [2018-11-28 13:02:48,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:02:48,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:02:48,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:02:48,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:02:48,827 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2018-11-28 13:02:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:48,846 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 13:02:48,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:02:48,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 13:02:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:48,847 INFO L225 Difference]: With dead ends: 31 [2018-11-28 13:02:48,847 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 13:02:48,848 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-11-28 13:02:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 13:02:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-28 13:02:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 13:02:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-28 13:02:48,851 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-11-28 13:02:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:48,851 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-28 13:02:48,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:02:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-28 13:02:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:02:48,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:48,852 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:48,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172714, now seen corresponding path program 1 times [2018-11-28 13:02:48,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:02:48,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:48,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:48,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:48,905 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-11-28 13:02:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:48,921 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-28 13:02:48,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:02:48,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 13:02:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:48,922 INFO L225 Difference]: With dead ends: 30 [2018-11-28 13:02:48,922 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 13:02:48,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 13:02:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 13:02:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 13:02:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-28 13:02:48,925 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-11-28 13:02:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:48,926 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-28 13:02:48,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-28 13:02:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:02:48,926 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:48,927 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:48,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020149, now seen corresponding path program 1 times [2018-11-28 13:02:48,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:02:48,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:02:48,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:02:48,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:02:48,984 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2018-11-28 13:02:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:49,030 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-28 13:02:49,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:02:49,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-28 13:02:49,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:49,030 INFO L225 Difference]: With dead ends: 29 [2018-11-28 13:02:49,030 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 13:02:49,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:02:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 13:02:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-28 13:02:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 13:02:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-28 13:02:49,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-11-28 13:02:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:49,032 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-28 13:02:49,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:02:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-28 13:02:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:02:49,033 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:49,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:49,033 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:49,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:49,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020148, now seen corresponding path program 1 times [2018-11-28 13:02:49,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:49,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:49,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:49,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:49,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:49,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:02:49,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:02:49,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:02:49,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:02:49,118 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2018-11-28 13:02:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:49,183 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-28 13:02:49,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:02:49,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 13:02:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:49,184 INFO L225 Difference]: With dead ends: 32 [2018-11-28 13:02:49,185 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 13:02:49,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:02:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 13:02:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-28 13:02:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 13:02:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-28 13:02:49,188 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2018-11-28 13:02:49,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:49,188 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-28 13:02:49,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:02:49,188 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-28 13:02:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:02:49,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:49,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:49,190 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:49,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:49,191 INFO L82 PathProgramCache]: Analyzing trace with hash -820999840, now seen corresponding path program 1 times [2018-11-28 13:02:49,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:49,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:49,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:49,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:49,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:49,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:02:49,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:02:49,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:02:49,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:02:49,244 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2018-11-28 13:02:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:49,315 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 13:02:49,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:02:49,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-28 13:02:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:49,315 INFO L225 Difference]: With dead ends: 31 [2018-11-28 13:02:49,315 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 13:02:49,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:02:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 13:02:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-28 13:02:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 13:02:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-28 13:02:49,319 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-11-28 13:02:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:49,319 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-28 13:02:49,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:02:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-28 13:02:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:02:49,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:49,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:49,320 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:49,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:49,320 INFO L82 PathProgramCache]: Analyzing trace with hash -820999839, now seen corresponding path program 1 times [2018-11-28 13:02:49,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:49,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:49,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:49,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:49,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:49,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:02:49,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:02:49,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:02:49,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:02:49,421 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2018-11-28 13:02:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:49,499 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-28 13:02:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:02:49,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-28 13:02:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:49,500 INFO L225 Difference]: With dead ends: 34 [2018-11-28 13:02:49,500 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 13:02:49,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:02:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 13:02:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-28 13:02:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 13:02:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-28 13:02:49,502 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2018-11-28 13:02:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:49,502 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-28 13:02:49,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:02:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-28 13:02:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:02:49,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:49,503 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:49,503 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:49,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:49,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2018091976, now seen corresponding path program 1 times [2018-11-28 13:02:49,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:49,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:49,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:49,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:02:49,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:02:49,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:02:49,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:02:49,620 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 11 states. [2018-11-28 13:02:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:49,741 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-28 13:02:49,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:02:49,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-28 13:02:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:49,742 INFO L225 Difference]: With dead ends: 56 [2018-11-28 13:02:49,742 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 13:02:49,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:02:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 13:02:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-11-28 13:02:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 13:02:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-28 13:02:49,747 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-11-28 13:02:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:49,748 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-28 13:02:49,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:02:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-28 13:02:49,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:02:49,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:49,748 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:49,749 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:49,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:49,749 INFO L82 PathProgramCache]: Analyzing trace with hash -2018089798, now seen corresponding path program 1 times [2018-11-28 13:02:49,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:49,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:49,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:49,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:02:49,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:02:49,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:02:49,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:02:49,861 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-11-28 13:02:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:49,999 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-11-28 13:02:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:02:50,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-28 13:02:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:50,002 INFO L225 Difference]: With dead ends: 94 [2018-11-28 13:02:50,002 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 13:02:50,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:02:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 13:02:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-11-28 13:02:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 13:02:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-11-28 13:02:50,010 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-11-28 13:02:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:50,010 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-28 13:02:50,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:02:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-28 13:02:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:02:50,011 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:50,011 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:50,011 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:50,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1255809144, now seen corresponding path program 1 times [2018-11-28 13:02:50,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:50,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:50,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:50,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:50,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:50,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:50,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:02:50,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:50,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:50,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-28 13:02:50,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-28 13:02:50,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:50,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 13:02:50,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 13:02:50,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 13:02:50,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:02:50,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:50,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:50,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-11-28 13:02:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:50,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:02:50,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-11-28 13:02:50,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 13:02:50,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 13:02:50,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:02:50,533 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 20 states. [2018-11-28 13:02:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:52,611 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2018-11-28 13:02:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 13:02:52,611 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-11-28 13:02:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:52,612 INFO L225 Difference]: With dead ends: 122 [2018-11-28 13:02:52,612 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 13:02:52,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=1109, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 13:02:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 13:02:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 91. [2018-11-28 13:02:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 13:02:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-11-28 13:02:52,619 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 23 [2018-11-28 13:02:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:52,620 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-11-28 13:02:52,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 13:02:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-11-28 13:02:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:02:52,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:52,621 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:52,621 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:52,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:52,621 INFO L82 PathProgramCache]: Analyzing trace with hash 688527418, now seen corresponding path program 1 times [2018-11-28 13:02:52,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:52,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:52,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:52,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:52,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:52,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:52,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:02:52,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:52,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:52,835 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-11-28 13:02:52,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-28 13:02:52,851 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 14 treesize of output 11 [2018-11-28 13:02:52,853 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 11 treesize of output 10 [2018-11-28 13:02:52,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:52,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-11-28 13:02:52,889 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 25 treesize of output 26 [2018-11-28 13:02:52,891 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 11 treesize of output 10 [2018-11-28 13:02:52,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:52,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-11-28 13:02:53,041 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 30 treesize of output 28 [2018-11-28 13:02:53,044 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 8 treesize of output 1 [2018-11-28 13:02:53,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:53,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 13:02:53,055 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:02:53,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:53,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:53,069 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-11-28 13:02:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:53,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:02:53,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-11-28 13:02:53,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 13:02:53,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 13:02:53,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:02:53,166 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 22 states. [2018-11-28 13:02:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:54,172 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-11-28 13:02:54,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 13:02:54,172 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-11-28 13:02:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:54,173 INFO L225 Difference]: With dead ends: 121 [2018-11-28 13:02:54,173 INFO L226 Difference]: Without dead ends: 121 [2018-11-28 13:02:54,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 13:02:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-28 13:02:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2018-11-28 13:02:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-28 13:02:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2018-11-28 13:02:54,179 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 23 [2018-11-28 13:02:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:54,179 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2018-11-28 13:02:54,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 13:02:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2018-11-28 13:02:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 13:02:54,180 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:54,180 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-11-28 13:02:54,180 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:54,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:54,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1863036971, now seen corresponding path program 1 times [2018-11-28 13:02:54,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:54,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:54,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:54,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:54,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:02:54,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:54,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:54,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:54,222 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 4 states. [2018-11-28 13:02:54,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:54,248 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2018-11-28 13:02:54,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:02:54,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-28 13:02:54,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:54,250 INFO L225 Difference]: With dead ends: 113 [2018-11-28 13:02:54,250 INFO L226 Difference]: Without dead ends: 91 [2018-11-28 13:02:54,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-28 13:02:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-28 13:02:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 13:02:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-11-28 13:02:54,253 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2018-11-28 13:02:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:54,253 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-11-28 13:02:54,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-11-28 13:02:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 13:02:54,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:54,254 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:54,254 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:54,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:54,254 INFO L82 PathProgramCache]: Analyzing trace with hash -728587261, now seen corresponding path program 2 times [2018-11-28 13:02:54,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:54,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:54,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:54,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:54,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:54,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:54,455 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:02:54,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:02:54,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:02:54,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:02:54,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:54,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:02:54,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:02:54,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:02:54,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:54,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 13:02:54,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 13:02:54,577 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 13 treesize of output 12 [2018-11-28 13:02:54,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:54,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-11-28 13:02:54,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-28 13:02:54,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:02:54,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:02:54,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:54,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:54,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-11-28 13:02:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:54,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:02:54,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-28 13:02:54,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 13:02:54,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 13:02:54,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-11-28 13:02:54,863 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 24 states. [2018-11-28 13:02:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:55,657 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-28 13:02:55,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 13:02:55,657 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-11-28 13:02:55,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:55,658 INFO L225 Difference]: With dead ends: 102 [2018-11-28 13:02:55,658 INFO L226 Difference]: Without dead ends: 79 [2018-11-28 13:02:55,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 13:02:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-28 13:02:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2018-11-28 13:02:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 13:02:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-28 13:02:55,662 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 28 [2018-11-28 13:02:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:55,663 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-28 13:02:55,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 13:02:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-28 13:02:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:02:55,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:55,664 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:55,664 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:02:55,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash -88962970, now seen corresponding path program 2 times [2018-11-28 13:02:55,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:55,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:55,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:55,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:02:55,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:55,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:55,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:02:55,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:02:55,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:02:55,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:02:55,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:55,949 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-11-28 13:02:55,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,954 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 9 treesize of output 12 [2018-11-28 13:02:55,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:02:55,957 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,972 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-28 13:02:55,995 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 16 treesize of output 13 [2018-11-28 13:02:56,000 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 13 treesize of output 12 [2018-11-28 13:02:56,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:56,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-11-28 13:02:56,034 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 29 treesize of output 30 [2018-11-28 13:02:56,036 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 13 treesize of output 12 [2018-11-28 13:02:56,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:56,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-11-28 13:02:56,263 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 34 treesize of output 32 [2018-11-28 13:02:56,265 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 10 treesize of output 1 [2018-11-28 13:02:56,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:02:56,273 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:02:56,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:56,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:56,285 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-11-28 13:02:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:56,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:02:56,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-11-28 13:02:56,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-28 13:02:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-28 13:02:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-11-28 13:02:56,394 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 25 states. [2018-11-28 13:02:57,617 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-11-28 13:03:00,798 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-11-28 13:03:02,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:02,666 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-11-28 13:03:02,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 13:03:02,666 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-11-28 13:03:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:02,667 INFO L225 Difference]: With dead ends: 62 [2018-11-28 13:03:02,667 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:03:02,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=206, Invalid=1353, Unknown=1, NotChecked=0, Total=1560 [2018-11-28 13:03:02,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:03:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:03:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:03:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:03:02,668 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-28 13:03:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:02,668 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:03:02,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-28 13:03:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:03:02,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:03:02,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:03:02 BoogieIcfgContainer [2018-11-28 13:03:02,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:03:02,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:03:02,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:03:02,672 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:03:02,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:02:48" (3/4) ... [2018-11-28 13:03:02,675 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:03:02,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:03:02,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2018-11-28 13:03:02,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 13:03:02,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 13:03:02,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:03:02,685 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-28 13:03:02,685 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 13:03:02,685 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 13:03:02,710 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:59) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:1) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.GeneratedWitnessEdge.getSourceCode(GeneratedWitnessEdge.java:153) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.lambda$2(CorrectnessWitnessGenerator.java:95) at edu.uci.ics.jung.io.GraphMLWriter.writeEdgeData(GraphMLWriter.java:237) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.UltimateGraphMLWriter.save(UltimateGraphMLWriter.java:106) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.makeGraphMLString(CorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:165) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:131) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-28 13:03:02,712 INFO L168 Benchmark]: Toolchain (without parser) took 14930.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.2 MB). Free memory was 956.0 MB in the beginning and 990.8 MB in the end (delta: -34.8 MB). Peak memory consumption was 272.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:02,712 INFO L168 Benchmark]: CDTParser took 0.18 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-11-28 13:03:02,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:02,713 INFO L168 Benchmark]: Boogie Preprocessor took 36.70 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:02,713 INFO L168 Benchmark]: RCFGBuilder took 311.28 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: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:02,713 INFO L168 Benchmark]: TraceAbstraction took 14219.75 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 990.8 MB in the end (delta: 67.6 MB). Peak memory consumption was 258.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:02,713 INFO L168 Benchmark]: Witness Printer took 39.31 ms. Allocated memory is still 1.3 GB. Free memory is still 990.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:03:02,714 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.18 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 320.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.70 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 311.28 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: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14219.75 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 990.8 MB in the end (delta: 67.6 MB). Peak memory consumption was 258.4 MB. Max. memory is 11.5 GB. * Witness Printer took 39.31 ms. Allocated memory is still 1.3 GB. Free memory is still 990.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 9 error locations. SAFE Result, 14.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 642 SDslu, 1766 SDs, 0 SdLazy, 1771 SolverSat, 164 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 369 ConstructedInterpolants, 37 QuantifiedInterpolants, 98008 SizeOfPredicates, 57 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 8/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:03:04,211 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:03:04,212 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:03:04,220 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:03:04,221 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:03:04,221 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:03:04,222 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:03:04,223 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:03:04,224 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:03:04,225 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:03:04,226 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:03:04,226 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:03:04,227 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:03:04,227 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:03:04,228 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:03:04,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:03:04,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:03:04,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:03:04,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:03:04,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:03:04,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:03:04,235 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:03:04,237 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:03:04,237 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:03:04,238 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:03:04,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:03:04,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:03:04,239 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:03:04,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:03:04,241 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:03:04,241 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:03:04,242 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:03:04,242 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:03:04,242 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:03:04,243 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:03:04,243 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:03:04,244 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-11-28 13:03:04,254 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:03:04,254 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:03:04,255 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:03:04,255 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:03:04,255 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:03:04,256 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:03:04,256 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:03:04,256 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:03:04,256 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:03:04,256 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:03:04,256 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:03:04,257 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:03:04,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:03:04,258 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 13:03:04,258 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 13:03:04,258 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 13:03:04,258 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:03:04,259 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 13:03:04,259 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 13:03:04,259 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:03:04,259 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:03:04,259 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:03:04,259 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:03:04,259 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:03:04,260 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:03:04,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:03:04,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:03:04,260 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:03:04,260 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 13:03:04,260 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:03:04,261 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 13:03:04,261 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/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 -> b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 [2018-11-28 13:03:04,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:03:04,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:03:04,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:03:04,298 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:03:04,298 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:03:04,299 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:03:04,343 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/data/171a3f0da/97196de3106b487282dbff742e121e9e/FLAG23ad165e1 [2018-11-28 13:03:04,685 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:03:04,686 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:03:04,694 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/data/171a3f0da/97196de3106b487282dbff742e121e9e/FLAG23ad165e1 [2018-11-28 13:03:04,701 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/data/171a3f0da/97196de3106b487282dbff742e121e9e [2018-11-28 13:03:04,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:03:04,704 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 13:03:04,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:03:04,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:03:04,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:03:04,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:03:04" (1/1) ... [2018-11-28 13:03:04,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f622ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:04, skipping insertion in model container [2018-11-28 13:03:04,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:03:04" (1/1) ... [2018-11-28 13:03:04,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:03:04,737 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:03:04,934 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:03:04,945 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:03:04,979 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:03:05,013 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:03:05,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05 WrapperNode [2018-11-28 13:03:05,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:03:05,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:03:05,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:03:05,058 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:03:05,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:03:05,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:03:05,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:03:05,100 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:03:05,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:03:05,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:03:05,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:03:05,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 13:03:05,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 13:03:05,135 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-11-28 13:03:05,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:03:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 13:03:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 13:03:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 13:03:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 13:03:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 13:03:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 13:03:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 13:03:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 13:03:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 13:03:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 13:03:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 13:03:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 13:03:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 13:03:05,137 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 13:03:05,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 13:03:05,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 13:03:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 13:03:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 13:03:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 13:03:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 13:03:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 13:03:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 13:03:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 13:03:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 13:03:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 13:03:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 13:03:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 13:03:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 13:03:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 13:03:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 13:03:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 13:03:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 13:03:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 13:03:05,141 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 13:03:05,141 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 13:03:05,141 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 13:03:05,141 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 13:03:05,141 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 13:03:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 13:03:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 13:03:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 13:03:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 13:03:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 13:03:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 13:03:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 13:03:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 13:03:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 13:03:05,142 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 13:03:05,143 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 13:03:05,143 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 13:03:05,143 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 13:03:05,143 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 13:03:05,143 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 13:03:05,143 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 13:03:05,143 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 13:03:05,143 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 13:03:05,143 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 13:03:05,144 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 13:03:05,145 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 13:03:05,145 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 13:03:05,145 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 13:03:05,145 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 13:03:05,145 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 13:03:05,145 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 13:03:05,145 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 13:03:05,145 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 13:03:05,145 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 13:03:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 13:03:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 13:03:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 13:03:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 13:03:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 13:03:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 13:03:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 13:03:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 13:03:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 13:03:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 13:03:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 13:03:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 13:03:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 13:03:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 13:03:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 13:03:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 13:03:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 13:03:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 13:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 13:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 13:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 13:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 13:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 13:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 13:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-11-28 13:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-28 13:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:03:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-28 13:03:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:03:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:03:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:03:05,432 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:03:05,432 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 13:03:05,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:03:05 BoogieIcfgContainer [2018-11-28 13:03:05,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:03:05,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:03:05,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:03:05,436 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:03:05,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:03:04" (1/3) ... [2018-11-28 13:03:05,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523e4cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:03:05, skipping insertion in model container [2018-11-28 13:03:05,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (2/3) ... [2018-11-28 13:03:05,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523e4cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:03:05, skipping insertion in model container [2018-11-28 13:03:05,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:03:05" (3/3) ... [2018-11-28 13:03:05,438 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:03:05,445 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:03:05,450 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-11-28 13:03:05,463 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-11-28 13:03:05,477 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:03:05,477 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:03:05,478 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 13:03:05,478 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:03:05,478 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:03:05,478 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:03:05,478 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:03:05,478 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:03:05,478 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:03:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-28 13:03:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:03:05,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:05,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:05,493 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:05,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851682, now seen corresponding path program 1 times [2018-11-28 13:03:05,499 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:05,500 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:05,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:05,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:05,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:05,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-28 13:03:05,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 13:03:05,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:05,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:05,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:05,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-11-28 13:03:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:05,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:05,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:05,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:03:05,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:03:05,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:03:05,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:03:05,662 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-11-28 13:03:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:05,716 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-28 13:03:05,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:03:05,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 13:03:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:05,722 INFO L225 Difference]: With dead ends: 36 [2018-11-28 13:03:05,723 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 13:03:05,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:03:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 13:03:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-28 13:03:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 13:03:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-28 13:03:05,744 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2018-11-28 13:03:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:05,744 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-28 13:03:05,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:03:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-28 13:03:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:03:05,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:05,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:05,745 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:05,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:05,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851683, now seen corresponding path program 1 times [2018-11-28 13:03:05,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:05,746 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:05,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:05,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:05,840 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-11-28 13:03:05,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:05,854 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 9 treesize of output 12 [2018-11-28 13:03:05,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:03:05,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:05,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:05,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:05,908 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2018-11-28 13:03:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:05,921 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:05,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:05,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:03:05,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:03:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:03:05,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:03:05,925 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2018-11-28 13:03:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:05,968 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-28 13:03:05,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:03:05,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 13:03:05,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:05,971 INFO L225 Difference]: With dead ends: 43 [2018-11-28 13:03:05,972 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 13:03:05,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:03:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 13:03:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-11-28 13:03:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 13:03:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-28 13:03:05,979 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 10 [2018-11-28 13:03:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:05,979 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-28 13:03:05,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:03:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-28 13:03:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:03:05,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:05,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:05,980 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:05,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:05,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1757911265, now seen corresponding path program 1 times [2018-11-28 13:03:05,981 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:05,981 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:05,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:06,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:06,063 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 9 treesize of output 12 [2018-11-28 13:03:06,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:03:06,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:06,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:06,125 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-11-28 13:03:06,125 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:06,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:06,145 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:13 [2018-11-28 13:03:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:06,159 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:06,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:06,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:03:06,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:03:06,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:03:06,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:03:06,163 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 4 states. [2018-11-28 13:03:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:06,204 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-28 13:03:06,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:03:06,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 13:03:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:06,206 INFO L225 Difference]: With dead ends: 35 [2018-11-28 13:03:06,206 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 13:03:06,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:03:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 13:03:06,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-28 13:03:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 13:03:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-28 13:03:06,210 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 10 [2018-11-28 13:03:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:06,210 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-28 13:03:06,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:03:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-28 13:03:06,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:03:06,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:06,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:06,211 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:06,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172715, now seen corresponding path program 1 times [2018-11-28 13:03:06,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:06,212 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:06,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:06,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:06,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:03:06,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 13:03:06,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:06,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:06,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:06,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-11-28 13:03:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:06,286 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:06,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:06,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:03:06,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:03:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:03:06,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:03:06,289 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2018-11-28 13:03:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:06,322 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 13:03:06,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:03:06,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 13:03:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:06,323 INFO L225 Difference]: With dead ends: 31 [2018-11-28 13:03:06,323 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 13:03:06,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:03:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 13:03:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-28 13:03:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 13:03:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-28 13:03:06,326 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-11-28 13:03:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:06,326 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-28 13:03:06,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:03:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-28 13:03:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:03:06,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:06,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:06,327 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:06,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172714, now seen corresponding path program 1 times [2018-11-28 13:03:06,327 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:06,328 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:06,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:06,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:06,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:03:06,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:03:06,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:03:06,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:03:06,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:06,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2018-11-28 13:03:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:06,432 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:06,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:06,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:03:06,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:03:06,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:03:06,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:03:06,434 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-11-28 13:03:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:06,469 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-28 13:03:06,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:03:06,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 13:03:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:06,471 INFO L225 Difference]: With dead ends: 38 [2018-11-28 13:03:06,471 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 13:03:06,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:03:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 13:03:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-11-28 13:03:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 13:03:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-28 13:03:06,476 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2018-11-28 13:03:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:06,476 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-28 13:03:06,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:03:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-28 13:03:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:03:06,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:06,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:06,477 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:06,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1341113132, now seen corresponding path program 1 times [2018-11-28 13:03:06,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:06,478 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:06,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:06,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:06,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:03:06,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:03:06,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:03:06,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:03:06,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:06,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2018-11-28 13:03:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:06,604 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:06,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:06,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:03:06,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:03:06,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:03:06,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:03:06,606 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2018-11-28 13:03:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:06,643 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-28 13:03:06,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:03:06,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 13:03:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:06,644 INFO L225 Difference]: With dead ends: 33 [2018-11-28 13:03:06,644 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 13:03:06,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:03:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 13:03:06,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-28 13:03:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 13:03:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-28 13:03:06,646 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-11-28 13:03:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:06,646 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-28 13:03:06,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:03:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-28 13:03:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:03:06,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:06,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:06,647 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:06,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020149, now seen corresponding path program 1 times [2018-11-28 13:03:06,648 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:06,648 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:06,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:06,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:06,724 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:06,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:06,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:03:06,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:03:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:03:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:03:06,726 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2018-11-28 13:03:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:06,811 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-28 13:03:06,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:03:06,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-28 13:03:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:06,812 INFO L225 Difference]: With dead ends: 29 [2018-11-28 13:03:06,812 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 13:03:06,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:03:06,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 13:03:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-28 13:03:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 13:03:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-28 13:03:06,814 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-11-28 13:03:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:06,815 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-28 13:03:06,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:03:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-28 13:03:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:03:06,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:06,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:06,816 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:06,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020148, now seen corresponding path program 1 times [2018-11-28 13:03:06,816 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:06,816 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:06,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:06,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:06,948 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:06,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:06,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:03:06,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:03:06,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:03:06,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:03:06,950 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2018-11-28 13:03:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:07,164 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-28 13:03:07,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:03:07,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 13:03:07,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:07,166 INFO L225 Difference]: With dead ends: 54 [2018-11-28 13:03:07,166 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 13:03:07,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:03:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 13:03:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-28 13:03:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 13:03:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-11-28 13:03:07,170 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2018-11-28 13:03:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:07,171 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-11-28 13:03:07,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:03:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-11-28 13:03:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:03:07,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:07,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:07,172 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:07,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:07,172 INFO L82 PathProgramCache]: Analyzing trace with hash -636961778, now seen corresponding path program 1 times [2018-11-28 13:03:07,173 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:07,173 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:07,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:07,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:07,332 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:07,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:07,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:03:07,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:03:07,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:03:07,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:03:07,334 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 8 states. [2018-11-28 13:03:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:07,563 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-28 13:03:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:03:07,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 13:03:07,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:07,566 INFO L225 Difference]: With dead ends: 51 [2018-11-28 13:03:07,566 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 13:03:07,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:03:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 13:03:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2018-11-28 13:03:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 13:03:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-28 13:03:07,568 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2018-11-28 13:03:07,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:07,569 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-28 13:03:07,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:03:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-28 13:03:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:03:07,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:07,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:07,570 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:07,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:07,570 INFO L82 PathProgramCache]: Analyzing trace with hash -820999840, now seen corresponding path program 1 times [2018-11-28 13:03:07,570 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:07,570 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:07,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:07,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:07,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:03:07,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 13:03:07,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:07,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:07,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:07,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-11-28 13:03:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:07,670 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:07,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:07,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:03:07,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:03:07,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:03:07,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:03:07,673 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2018-11-28 13:03:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:07,788 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 13:03:07,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:03:07,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-28 13:03:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:07,789 INFO L225 Difference]: With dead ends: 31 [2018-11-28 13:03:07,789 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 13:03:07,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:03:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 13:03:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-28 13:03:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 13:03:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-28 13:03:07,791 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-11-28 13:03:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:07,791 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-28 13:03:07,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:03:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-28 13:03:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:03:07,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:07,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:07,792 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:07,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash -820999839, now seen corresponding path program 1 times [2018-11-28 13:03:07,792 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:07,792 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:07,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:07,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:07,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:03:07,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:03:07,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:03:07,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:03:07,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:07,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 13:03:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:07,946 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:07,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:07,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:03:07,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:03:07,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:03:07,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:03:07,948 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2018-11-28 13:03:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:08,101 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-28 13:03:08,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:03:08,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 13:03:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:08,102 INFO L225 Difference]: With dead ends: 56 [2018-11-28 13:03:08,102 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 13:03:08,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:03:08,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 13:03:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-11-28 13:03:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 13:03:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-28 13:03:08,105 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 18 [2018-11-28 13:03:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:08,105 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-28 13:03:08,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:03:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-28 13:03:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:03:08,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:08,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:08,105 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:08,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash -119935261, now seen corresponding path program 1 times [2018-11-28 13:03:08,106 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:08,106 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:08,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:08,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:08,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:03:08,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:03:08,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:03:08,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:03:08,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2018-11-28 13:03:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:08,281 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:08,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:08,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:03:08,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:03:08,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:03:08,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:03:08,283 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 8 states. [2018-11-28 13:03:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:08,475 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-28 13:03:08,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:03:08,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 13:03:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:08,476 INFO L225 Difference]: With dead ends: 55 [2018-11-28 13:03:08,476 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 13:03:08,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:03:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 13:03:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-11-28 13:03:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 13:03:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-28 13:03:08,478 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2018-11-28 13:03:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:08,478 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-28 13:03:08,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:03:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-28 13:03:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:03:08,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:08,479 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:08,479 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:08,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2018091976, now seen corresponding path program 1 times [2018-11-28 13:03:08,480 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:08,480 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:08,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:08,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:08,598 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-11-28 13:03:08,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-28 13:03:08,622 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 12 treesize of output 9 [2018-11-28 13:03:08,624 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 9 treesize of output 8 [2018-11-28 13:03:08,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 13:03:08,651 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 24 treesize of output 25 [2018-11-28 13:03:08,654 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-11-28 13:03:08,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:08,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2018-11-28 13:03:08,784 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 28 treesize of output 26 [2018-11-28 13:03:08,787 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 9 treesize of output 1 [2018-11-28 13:03:08,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,792 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 13 treesize of output 5 [2018-11-28 13:03:08,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:08,796 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-11-28 13:03:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:08,839 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:08,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:08,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 13:03:08,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:03:08,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:03:08,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:03:08,841 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2018-11-28 13:03:09,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:09,435 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-28 13:03:09,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:03:09,435 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-28 13:03:09,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:09,436 INFO L225 Difference]: With dead ends: 56 [2018-11-28 13:03:09,436 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 13:03:09,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:03:09,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 13:03:09,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-11-28 13:03:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 13:03:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-28 13:03:09,439 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-11-28 13:03:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:09,439 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-28 13:03:09,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:03:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-28 13:03:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:03:09,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:09,440 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:09,440 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:09,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:09,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2018089798, now seen corresponding path program 1 times [2018-11-28 13:03:09,441 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:09,441 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:09,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:09,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:09,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-11-28 13:03:09,517 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 9 treesize of output 8 [2018-11-28 13:03:09,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:09,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:09,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:09,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-28 13:03:09,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 13:03:09,566 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 13 treesize of output 5 [2018-11-28 13:03:09,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:09,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:09,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:09,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-28 13:03:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:09,599 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:09,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:09,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:03:09,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:03:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:03:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:03:09,602 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-11-28 13:03:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:09,955 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-11-28 13:03:09,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:03:09,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-28 13:03:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:09,956 INFO L225 Difference]: With dead ends: 94 [2018-11-28 13:03:09,956 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 13:03:09,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:03:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 13:03:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-11-28 13:03:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 13:03:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-11-28 13:03:09,961 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-11-28 13:03:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:09,962 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-28 13:03:09,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:03:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-28 13:03:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:03:09,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:09,963 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:09,963 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:09,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1255809144, now seen corresponding path program 1 times [2018-11-28 13:03:09,963 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:09,963 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:09,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:10,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:10,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:03:10,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:03:10,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:03:10,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:03:10,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:10,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2018-11-28 13:03:10,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-28 13:03:10,106 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 14 treesize of output 13 [2018-11-28 13:03:10,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:10,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:10,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:10,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2018-11-28 13:03:10,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-28 13:03:10,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-11-28 13:03:10,279 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:10,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:10,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:10,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:38 [2018-11-28 13:03:10,486 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-28 13:03:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:10,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:03:11,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-28 13:03:11,475 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 13:03:11,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:11,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:11,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-11-28 13:03:11,568 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 13:03:11,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:11,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:11,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-28 13:03:11,657 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 13:03:11,659 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:11,689 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:11,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:03:11,772 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:119, output treesize:77 [2018-11-28 13:03:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:12,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:12,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-11-28 13:03:12,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 13:03:12,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 13:03:12,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-11-28 13:03:12,017 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 23 states. [2018-11-28 13:03:12,294 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-11-28 13:03:13,110 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-11-28 13:03:13,376 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-11-28 13:03:13,783 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 13:03:15,390 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 13:03:19,923 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 13:03:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:19,960 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-11-28 13:03:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 13:03:19,962 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-11-28 13:03:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:19,962 INFO L225 Difference]: With dead ends: 108 [2018-11-28 13:03:19,962 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 13:03:19,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 13:03:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 13:03:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 91. [2018-11-28 13:03:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 13:03:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-11-28 13:03:19,968 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 23 [2018-11-28 13:03:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:19,968 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-11-28 13:03:19,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 13:03:19,968 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-11-28 13:03:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:03:19,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:19,969 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:19,969 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:19,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:19,970 INFO L82 PathProgramCache]: Analyzing trace with hash 688527418, now seen corresponding path program 1 times [2018-11-28 13:03:19,970 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:19,970 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:19,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:20,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:20,074 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-11-28 13:03:20,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:20,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:20,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 13:03:20,102 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-11-28 13:03:20,105 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-11-28 13:03:20,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:20,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:20,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:20,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:36 [2018-11-28 13:03:20,165 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 24 treesize of output 25 [2018-11-28 13:03:20,169 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 9 treesize of output 8 [2018-11-28 13:03:20,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:20,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:20,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:20,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-11-28 13:03:20,342 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 29 treesize of output 27 [2018-11-28 13:03:20,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-11-28 13:03:20,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:20,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:20,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:20,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-11-28 13:03:20,634 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-11-28 13:03:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:20,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:03:22,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-11-28 13:03:22,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:22,917 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2018-11-28 13:03:22,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:23,205 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2018-11-28 13:03:23,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:23,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 65 [2018-11-28 13:03:23,606 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-11-28 13:03:23,612 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 13 treesize of output 12 [2018-11-28 13:03:23,612 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:23,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-28 13:03:23,678 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:03:23,679 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:03:23,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-28 13:03:23,680 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:23,695 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:23,753 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:24,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2018-11-28 13:03:24,263 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2018-11-28 13:03:24,273 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 13 treesize of output 12 [2018-11-28 13:03:24,273 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:24,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-28 13:03:24,350 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:03:24,351 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:03:24,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-28 13:03:24,353 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:24,373 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:24,434 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:24,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 65 [2018-11-28 13:03:24,983 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-28 13:03:24,993 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 13 treesize of output 12 [2018-11-28 13:03:24,993 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:25,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-28 13:03:27,072 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= main_~nondetString1~0.offset (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32))) [2018-11-28 13:03:27,074 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:03:27,075 INFO L303 Elim1Store]: Index analysis took 2009 ms [2018-11-28 13:03:27,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 [2018-11-28 13:03:27,077 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:27,092 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:27,142 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:27,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-28 13:03:27,490 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:245, output treesize:206 [2018-11-28 13:03:28,338 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2018-11-28 13:03:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:28,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:28,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2018-11-28 13:03:28,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-28 13:03:28,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-28 13:03:28,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-11-28 13:03:28,507 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 27 states. [2018-11-28 13:03:28,904 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 13:03:29,904 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-11-28 13:03:30,751 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-28 13:03:31,302 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-28 13:03:31,898 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-28 13:03:32,267 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-11-28 13:03:33,137 WARN L180 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2018-11-28 13:03:33,676 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-28 13:03:34,293 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-28 13:03:34,605 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2018-11-28 13:03:36,225 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 13:03:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:36,617 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-11-28 13:03:36,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 13:03:36,618 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-11-28 13:03:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:36,619 INFO L225 Difference]: With dead ends: 124 [2018-11-28 13:03:36,619 INFO L226 Difference]: Without dead ends: 124 [2018-11-28 13:03:36,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=279, Invalid=1977, Unknown=0, NotChecked=0, Total=2256 [2018-11-28 13:03:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-28 13:03:36,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2018-11-28 13:03:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-28 13:03:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2018-11-28 13:03:36,624 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 23 [2018-11-28 13:03:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:36,624 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2018-11-28 13:03:36,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-28 13:03:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2018-11-28 13:03:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 13:03:36,625 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:36,625 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-11-28 13:03:36,626 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:03:36,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:36,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1863036971, now seen corresponding path program 1 times [2018-11-28 13:03:36,626 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:03:36,626 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:03:36,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:36,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:36,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:03:36,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:36,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:36,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:03:36,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:36,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2018-11-28 13:03:36,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:36,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:36,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-28 13:03:36,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:36,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:36,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-28 13:03:36,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:36,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:03:36,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:36,822 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:38 [2018-11-28 13:03:42,891 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 13:03:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:42,893 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:03:42,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:42,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:03:42,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:03:42,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:03:42,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2018-11-28 13:03:42,896 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 7 states. [2018-11-28 13:04:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:04:05,160 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2018-11-28 13:04:05,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:04:05,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-28 13:04:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:04:05,161 INFO L225 Difference]: With dead ends: 113 [2018-11-28 13:04:05,161 INFO L226 Difference]: Without dead ends: 91 [2018-11-28 13:04:05,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=25, Invalid=45, Unknown=2, NotChecked=0, Total=72 [2018-11-28 13:04:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-28 13:04:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-28 13:04:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 13:04:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-11-28 13:04:05,164 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2018-11-28 13:04:05,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:04:05,164 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-11-28 13:04:05,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:04:05,164 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-11-28 13:04:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 13:04:05,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:04:05,168 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:04:05,168 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:04:05,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:04:05,168 INFO L82 PathProgramCache]: Analyzing trace with hash -728587261, now seen corresponding path program 2 times [2018-11-28 13:04:05,168 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:04:05,168 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:04:05,181 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-28 13:04:05,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:04:05,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:04:05,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:04:05,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:04:05,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:04:05,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:05,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:05,331 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-11-28 13:04:05,331 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:05,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:05,346 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-11-28 13:04:05,369 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 17 treesize of output 14 [2018-11-28 13:04:05,372 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 14 treesize of output 13 [2018-11-28 13:04:05,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:05,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:05,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:05,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-28 13:04:05,426 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 31 treesize of output 32 [2018-11-28 13:04:05,429 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 14 treesize of output 13 [2018-11-28 13:04:05,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:05,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:05,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:05,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:50 [2018-11-28 13:04:06,007 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 33 treesize of output 31 [2018-11-28 13:04:06,011 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 10 treesize of output 1 [2018-11-28 13:04:06,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:06,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-11-28 13:04:06,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:04:06,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:04:06,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 13:04:06,054 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-11-28 13:04:06,299 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-11-28 13:04:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:04:06,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:04:08,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-28 13:04:08,345 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 13 treesize of output 12 [2018-11-28 13:04:08,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:08,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-11-28 13:04:08,493 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 28 treesize of output 18 [2018-11-28 13:04:08,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:08,542 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 13:04:08,543 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:10,586 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32)) (bvadd main_~nondetString2~0.offset (_ bv1 32))) [2018-11-28 13:04:10,589 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:04:10,590 INFO L303 Elim1Store]: Index analysis took 2018 ms [2018-11-28 13:04:10,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 18 [2018-11-28 13:04:10,592 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:10,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:04:10,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:04:10,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-11-28 13:04:10,658 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 13 treesize of output 12 [2018-11-28 13:04:10,658 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:10,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-11-28 13:04:10,814 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 28 treesize of output 18 [2018-11-28 13:04:10,815 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:10,862 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-28 13:04:10,863 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:12,912 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32)) (bvadd main_~nondetString2~0.offset (_ bv1 32))) [2018-11-28 13:04:12,915 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:04:12,916 INFO L303 Elim1Store]: Index analysis took 2017 ms [2018-11-28 13:04:12,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 23 [2018-11-28 13:04:12,918 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:12,945 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:04:13,006 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:04:13,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-11-28 13:04:13,033 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 13 treesize of output 12 [2018-11-28 13:04:13,034 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:13,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-11-28 13:04:13,200 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 28 treesize of output 18 [2018-11-28 13:04:13,200 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:13,263 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:04:13,264 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:04:13,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-28 13:04:13,266 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:13,312 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-28 13:04:13,313 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:13,341 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:04:13,421 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:04:13,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-28 13:04:13,636 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:185, output treesize:242 [2018-11-28 13:04:14,209 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 13:04:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:04:14,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:04:14,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2018-11-28 13:04:14,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-28 13:04:14,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-28 13:04:14,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2018-11-28 13:04:14,226 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 30 states. [2018-11-28 13:04:14,826 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-28 13:04:15,716 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-28 13:04:16,076 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 13:04:17,020 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-28 13:04:17,579 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-28 13:04:18,251 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2018-11-28 13:04:18,882 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 13:04:19,903 WARN L180 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2018-11-28 13:04:20,546 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-28 13:04:21,225 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2018-11-28 13:04:21,754 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2018-11-28 13:04:22,141 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-11-28 13:04:22,679 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-28 13:04:23,097 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-11-28 13:04:23,650 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-28 13:04:24,170 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-11-28 13:04:25,214 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2018-11-28 13:04:25,951 WARN L180 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-11-28 13:04:27,028 WARN L180 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2018-11-28 13:04:27,753 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2018-11-28 13:04:28,290 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-28 13:04:28,871 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-11-28 13:04:29,545 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 13:04:30,272 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2018-11-28 13:04:30,910 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 13:04:31,749 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2018-11-28 13:04:32,933 WARN L180 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2018-11-28 13:04:33,451 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-28 13:04:34,074 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-11-28 13:04:34,815 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-11-28 13:04:35,431 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-11-28 13:04:36,322 WARN L180 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2018-11-28 13:04:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:04:37,522 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2018-11-28 13:04:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-28 13:04:37,524 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 28 [2018-11-28 13:04:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:04:37,525 INFO L225 Difference]: With dead ends: 123 [2018-11-28 13:04:37,525 INFO L226 Difference]: Without dead ends: 123 [2018-11-28 13:04:37,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=704, Invalid=4126, Unknown=0, NotChecked=0, Total=4830 [2018-11-28 13:04:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-28 13:04:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2018-11-28 13:04:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 13:04:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-11-28 13:04:37,529 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 28 [2018-11-28 13:04:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:04:37,529 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-11-28 13:04:37,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-28 13:04:37,529 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-11-28 13:04:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:04:37,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:04:37,530 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:04:37,530 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:04:37,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:04:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash -88962970, now seen corresponding path program 2 times [2018-11-28 13:04:37,530 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:04:37,530 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:04:37,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:04:37,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:04:37,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:04:37,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:04:37,670 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-11-28 13:04:37,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:37,686 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 9 treesize of output 12 [2018-11-28 13:04:37,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:04:37,694 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:37,701 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:37,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:37,713 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-11-28 13:04:37,739 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 17 treesize of output 14 [2018-11-28 13:04:37,744 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 14 treesize of output 13 [2018-11-28 13:04:37,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:37,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:37,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:37,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-11-28 13:04:37,828 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 31 treesize of output 32 [2018-11-28 13:04:37,833 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 14 treesize of output 13 [2018-11-28 13:04:37,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:37,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:37,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:04:37,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-11-28 13:04:38,313 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 34 treesize of output 32 [2018-11-28 13:04:38,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-11-28 13:04:38,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:04:38,349 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 1 [2018-11-28 13:04:38,349 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:38,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:04:38,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:04:38,377 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2018-11-28 13:04:38,594 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-28 13:04:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:04:38,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:04:41,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2018-11-28 13:04:41,329 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-11-28 13:04:41,340 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-11-28 13:04:41,340 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:04:41,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:04:41,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2018-11-28 13:04:41,588 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-11-28 13:04:41,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:04:41,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:04:41,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2018-11-28 13:04:41,861 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-11-28 13:04:41,861 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:04:41,900 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:04:42,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:04:42,041 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:191, output treesize:109 [2018-11-28 13:04:42,360 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 13:04:42,369 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:42,369 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:60, output treesize:1 [2018-11-28 13:04:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:04:42,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:04:42,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2018-11-28 13:04:42,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 13:04:42,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 13:04:42,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-11-28 13:04:42,381 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 26 states. [2018-11-28 13:04:43,242 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-11-28 13:04:44,979 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2018-11-28 13:04:45,840 WARN L180 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2018-11-28 13:04:46,427 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-11-28 13:04:47,139 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-11-28 13:04:47,522 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-11-28 13:04:48,898 WARN L180 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-11-28 13:04:49,515 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-11-28 13:04:50,336 WARN L180 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2018-11-28 13:04:51,218 WARN L180 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2018-11-28 13:04:51,673 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2018-11-28 13:04:53,018 WARN L180 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2018-11-28 13:04:54,267 WARN L180 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2018-11-28 13:04:55,041 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-28 13:04:55,821 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-28 13:04:56,340 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-28 13:04:57,071 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-11-28 13:04:57,964 WARN L180 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2018-11-28 13:05:00,362 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-28 13:05:00,867 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 13:05:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:05:02,447 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2018-11-28 13:05:02,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 13:05:02,449 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2018-11-28 13:05:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:05:02,449 INFO L225 Difference]: With dead ends: 204 [2018-11-28 13:05:02,449 INFO L226 Difference]: Without dead ends: 204 [2018-11-28 13:05:02,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=372, Invalid=2178, Unknown=0, NotChecked=0, Total=2550 [2018-11-28 13:05:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-28 13:05:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2018-11-28 13:05:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-28 13:05:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2018-11-28 13:05:02,454 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 31 [2018-11-28 13:05:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:05:02,454 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2018-11-28 13:05:02,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 13:05:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2018-11-28 13:05:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 13:05:02,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:05:02,455 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:05:02,455 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:05:02,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:02,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2004369190, now seen corresponding path program 1 times [2018-11-28 13:05:02,456 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:05:02,456 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:05:02,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:02,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:02,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:05:02,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:05:02,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:05:02,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:05:02,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:02,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2018-11-28 13:05:02,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-28 13:05:02,606 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 14 treesize of output 13 [2018-11-28 13:05:02,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:02,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:02,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:02,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2018-11-28 13:05:02,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-28 13:05:02,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:05:02,922 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:05:02,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:05:02,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:05:02,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:38 [2018-11-28 13:05:03,128 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-11-28 13:05:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:03,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:05:04,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2018-11-28 13:05:04,965 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-11-28 13:05:04,969 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-28 13:05:04,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:05,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:05,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-11-28 13:05:05,109 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-28 13:05:05,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:05,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:05,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2018-11-28 13:05:05,274 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-11-28 13:05:05,279 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-28 13:05:05,280 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:05,330 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:05,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:05:05,455 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:173, output treesize:121 [2018-11-28 13:05:05,790 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 13:05:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:05,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:05:05,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-11-28 13:05:05,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-28 13:05:05,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-28 13:05:05,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2018-11-28 13:05:05,802 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand 29 states. [2018-11-28 13:05:06,529 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 13:05:06,894 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-11-28 13:05:07,270 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-11-28 13:05:07,699 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2018-11-28 13:05:08,083 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-11-28 13:05:09,347 WARN L180 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-11-28 13:05:10,127 WARN L180 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-11-28 13:05:10,770 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-11-28 13:05:11,075 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-11-28 13:05:11,299 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-28 13:05:12,086 WARN L180 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-11-28 13:05:12,780 WARN L180 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-11-28 13:05:14,056 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-11-28 13:05:14,740 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-11-28 13:05:15,185 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-11-28 13:05:15,807 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-11-28 13:05:16,493 WARN L180 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2018-11-28 13:05:17,182 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2018-11-28 13:05:17,635 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-28 13:05:18,057 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-11-28 13:05:18,708 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2018-11-28 13:05:19,388 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-11-28 13:05:19,983 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2018-11-28 13:05:20,313 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 13:05:20,695 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-11-28 13:05:21,463 WARN L180 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2018-11-28 13:05:21,995 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-11-28 13:05:22,512 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-11-28 13:05:22,809 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 13:05:23,364 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 13:05:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:05:23,638 INFO L93 Difference]: Finished difference Result 385 states and 428 transitions. [2018-11-28 13:05:23,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-28 13:05:23,641 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2018-11-28 13:05:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:05:23,643 INFO L225 Difference]: With dead ends: 385 [2018-11-28 13:05:23,643 INFO L226 Difference]: Without dead ends: 385 [2018-11-28 13:05:23,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=697, Invalid=3209, Unknown=0, NotChecked=0, Total=3906 [2018-11-28 13:05:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-11-28 13:05:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 310. [2018-11-28 13:05:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-28 13:05:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 353 transitions. [2018-11-28 13:05:23,653 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 353 transitions. Word has length 33 [2018-11-28 13:05:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:05:23,653 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 353 transitions. [2018-11-28 13:05:23,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-28 13:05:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 353 transitions. [2018-11-28 13:05:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:05:23,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:05:23,655 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:05:23,655 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:05:23,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:23,655 INFO L82 PathProgramCache]: Analyzing trace with hash -847293160, now seen corresponding path program 3 times [2018-11-28 13:05:23,655 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:05:23,656 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:05:23,673 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-28 13:05:23,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-28 13:05:23,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:05:23,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:23,955 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-11-28 13:05:23,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:23,975 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 9 treesize of output 12 [2018-11-28 13:05:23,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:05:23,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:23,987 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:24,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:24,002 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-11-28 13:05:24,027 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 17 treesize of output 14 [2018-11-28 13:05:24,029 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 14 treesize of output 13 [2018-11-28 13:05:24,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:24,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:24,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:24,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-28 13:05:24,087 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 30 treesize of output 31 [2018-11-28 13:05:24,091 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 13 treesize of output 12 [2018-11-28 13:05:24,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:24,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:24,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:24,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:46 [2018-11-28 13:05:24,556 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 35 treesize of output 33 [2018-11-28 13:05:24,562 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 10 treesize of output 1 [2018-11-28 13:05:24,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:24,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:05:24,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:05:24,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:05:24,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 13:05:24,628 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:70 [2018-11-28 13:05:24,989 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-11-28 13:05:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-28 13:05:25,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:06:12,422 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-28 13:06:12,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 73 [2018-11-28 13:06:12,443 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 13 treesize of output 12 [2018-11-28 13:06:12,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:06:12,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-11-28 13:06:12,650 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 28 treesize of output 18 [2018-11-28 13:06:12,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:06:14,717 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd v_prenex_40 (_ bv4294967295 32)) (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32))) [2018-11-28 13:06:14,720 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:06:14,722 INFO L303 Elim1Store]: Index analysis took 2018 ms [2018-11-28 13:06:14,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 23 [2018-11-28 13:06:14,724 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:06:14,779 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-28 13:06:14,780 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:06:14,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:06:14,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:06:15,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2018-11-28 13:06:15,164 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 13 treesize of output 12 [2018-11-28 13:06:15,164 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:06:15,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-11-28 13:06:15,360 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:06:15,360 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:06:15,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-28 13:06:15,363 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:06:15,436 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 28 treesize of output 18 [2018-11-28 13:06:15,436 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:06:15,507 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-28 13:06:15,508 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 13:06:15,550 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:06:15,621 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:06:15,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-28 13:06:15,890 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:143, output treesize:183 [2018-11-28 13:06:17,077 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-28 13:06:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-28 13:06:17,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:06:17,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 27 [2018-11-28 13:06:17,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 13:06:17,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 13:06:17,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=671, Unknown=9, NotChecked=0, Total=756 [2018-11-28 13:06:17,268 INFO L87 Difference]: Start difference. First operand 310 states and 353 transitions. Second operand 28 states. [2018-11-28 13:06:23,049 WARN L180 SmtUtils]: Spent 503.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-28 13:06:30,173 WARN L180 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2018-11-28 13:06:31,820 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-28 13:06:36,313 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2018-11-28 13:06:45,131 WARN L180 SmtUtils]: Spent 8.37 s on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2018-11-28 13:06:54,224 WARN L180 SmtUtils]: Spent 8.36 s on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2018-11-28 13:07:07,887 WARN L180 SmtUtils]: Spent 12.67 s on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2018-11-28 13:07:08,260 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-28 13:07:22,091 WARN L180 SmtUtils]: Spent 13.11 s on a formula simplification. DAG size of input: 148 DAG size of output: 100 [2018-11-28 13:07:23,361 WARN L180 SmtUtils]: Spent 647.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-28 13:07:38,180 WARN L180 SmtUtils]: Spent 13.94 s on a formula simplification. DAG size of input: 171 DAG size of output: 109 [2018-11-28 13:07:40,011 WARN L180 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2018-11-28 13:07:55,259 WARN L180 SmtUtils]: Spent 14.31 s on a formula simplification. DAG size of input: 175 DAG size of output: 116 [2018-11-28 13:07:57,505 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 111 DAG size of output: 108 [2018-11-28 13:08:13,128 WARN L180 SmtUtils]: Spent 14.13 s on a formula simplification. DAG size of input: 146 DAG size of output: 103 [2018-11-28 13:08:14,176 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-28 13:08:28,417 WARN L180 SmtUtils]: Spent 13.17 s on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2018-11-28 13:08:29,594 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-11-28 13:08:45,612 WARN L180 SmtUtils]: Spent 14.91 s on a formula simplification. DAG size of input: 156 DAG size of output: 100 [2018-11-28 13:08:47,878 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-11-28 13:09:02,903 WARN L180 SmtUtils]: Spent 14.10 s on a formula simplification. DAG size of input: 179 DAG size of output: 108 [2018-11-28 13:09:18,811 WARN L180 SmtUtils]: Spent 14.71 s on a formula simplification. DAG size of input: 183 DAG size of output: 111 [2018-11-28 13:09:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:19,887 INFO L93 Difference]: Finished difference Result 309 states and 347 transitions. [2018-11-28 13:09:19,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 13:09:19,892 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2018-11-28 13:09:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:19,892 INFO L225 Difference]: With dead ends: 309 [2018-11-28 13:09:19,893 INFO L226 Difference]: Without dead ends: 263 [2018-11-28 13:09:19,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 224.8s TimeCoverageRelationStatistics Valid=391, Invalid=2249, Unknown=12, NotChecked=0, Total=2652 [2018-11-28 13:09:19,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-28 13:09:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 103. [2018-11-28 13:09:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 13:09:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2018-11-28 13:09:19,897 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 53 [2018-11-28 13:09:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:19,897 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2018-11-28 13:09:19,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-28 13:09:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2018-11-28 13:09:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:09:19,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:19,898 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:19,899 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 13:09:19,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:19,899 INFO L82 PathProgramCache]: Analyzing trace with hash -196194070, now seen corresponding path program 3 times [2018-11-28 13:09:19,899 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:09:19,899 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9190acd9-e670-4021-bbbf-88591987037e/bin-2019/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:09:19,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:09:20,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-28 13:09:20,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:20,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:20,204 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-11-28 13:09:20,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:20,221 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 9 treesize of output 12 [2018-11-28 13:09:20,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:09:20,226 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:20,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:20,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:20,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-11-28 13:09:20,278 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 16 treesize of output 13 [2018-11-28 13:09:20,281 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 13 treesize of output 12 [2018-11-28 13:09:20,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:20,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:20,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:20,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2018-11-28 13:09:20,354 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 30 treesize of output 31 [2018-11-28 13:09:20,358 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 14 treesize of output 13 [2018-11-28 13:09:20,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:20,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:20,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:20,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-11-28 13:09:20,688 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 35 treesize of output 33 [2018-11-28 13:09:20,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:09:20,707 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:09:20,734 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 10 treesize of output 1 [2018-11-28 13:09:20,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:20,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:09:20,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:09:20,801 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:80, output treesize:80 [2018-11-28 13:09:21,164 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-11-28 13:09:21,646 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2018-11-28 13:09:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-28 13:09:21,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:09:25,873 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 13:09:57,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 92 [2018-11-28 13:09:58,137 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-11-28 13:09:58,148 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 13 treesize of output 12 [2018-11-28 13:09:58,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:58,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 13:10:00,289 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd v_prenex_56 (_ bv4294967295 32)) (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32))) [2018-11-28 13:10:00,294 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:10:00,295 INFO L303 Elim1Store]: Index analysis took 2018 ms [2018-11-28 13:10:00,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 19 [2018-11-28 13:10:00,296 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:10:00,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:10:00,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:10:00,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 70 [2018-11-28 13:10:01,105 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-11-28 13:10:01,118 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 13 treesize of output 12 [2018-11-28 13:10:01,118 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:01,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 13:10:01,236 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:10:01,237 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:10:01,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-28 13:10:01,239 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:10:01,266 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:10:01,364 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:10:01,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-28 13:10:01,778 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:205, output treesize:181 [2018-11-28 13:10:03,028 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 13:10:03,159 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 1 [2018-11-28 13:10:03,160 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:03,160 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 20 variables, input treesize:221, output treesize:1 [2018-11-28 13:10:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-28 13:10:03,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:03,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2018-11-28 13:10:03,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-28 13:10:03,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-28 13:10:03,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=620, Unknown=8, NotChecked=0, Total=702 [2018-11-28 13:10:03,186 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand 27 states. [2018-11-28 13:10:04,235 WARN L180 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-28 13:10:08,612 WARN L180 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2018-11-28 13:10:10,024 WARN L180 SmtUtils]: Spent 759.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-28 13:10:14,593 WARN L180 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2018-11-28 13:10:16,032 WARN L180 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-28 13:10:20,443 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2018-11-28 13:10:29,162 WARN L180 SmtUtils]: Spent 8.30 s on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2018-11-28 13:10:54,653 WARN L180 SmtUtils]: Spent 24.63 s on a formula simplification. DAG size of input: 141 DAG size of output: 95 [2018-11-28 13:10:55,912 WARN L180 SmtUtils]: Spent 789.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-11-28 13:11:17,729 WARN L180 SmtUtils]: Spent 21.08 s on a formula simplification. DAG size of input: 154 DAG size of output: 101 [2018-11-28 13:11:19,893 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2018-11-28 13:11:29,350 WARN L180 SmtUtils]: Spent 8.71 s on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2018-11-28 13:11:30,241 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-11-28 13:11:40,295 WARN L180 SmtUtils]: Spent 8.96 s on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2018-11-28 13:11:50,289 WARN L180 SmtUtils]: Spent 8.77 s on a formula simplification. DAG size of input: 136 DAG size of output: 92 [2018-11-28 13:11:51,261 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-28 13:12:00,719 WARN L180 SmtUtils]: Spent 8.49 s on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2018-11-28 13:12:01,394 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-28 13:12:23,534 WARN L180 SmtUtils]: Spent 21.05 s on a formula simplification. DAG size of input: 152 DAG size of output: 94 [2018-11-28 13:12:25,420 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2018-11-28 13:12:47,433 WARN L180 SmtUtils]: Spent 21.21 s on a formula simplification. DAG size of input: 165 DAG size of output: 101 [2018-11-28 13:12:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:47,922 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-11-28 13:12:47,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 13:12:47,923 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2018-11-28 13:12:47,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:47,924 INFO L225 Difference]: With dead ends: 117 [2018-11-28 13:12:47,924 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:12:47,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 198.9s TimeCoverageRelationStatistics Valid=319, Invalid=2025, Unknown=8, NotChecked=0, Total=2352 [2018-11-28 13:12:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:12:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:12:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:12:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:12:47,925 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-11-28 13:12:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:47,925 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:12:47,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-28 13:12:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:12:47,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:12:47,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:12:47 BoogieIcfgContainer [2018-11-28 13:12:47,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:12:47,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:12:47,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:12:47,930 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:12:47,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:03:05" (3/4) ... [2018-11-28 13:12:47,933 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:12:47,938 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:12:47,938 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2018-11-28 13:12:47,938 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 13:12:47,939 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 13:12:47,939 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:12:47,943 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-28 13:12:47,943 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 13:12:47,943 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 13:12:47,965 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:59) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:1) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.GeneratedWitnessEdge.getSourceCode(GeneratedWitnessEdge.java:153) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.lambda$2(CorrectnessWitnessGenerator.java:95) at edu.uci.ics.jung.io.GraphMLWriter.writeEdgeData(GraphMLWriter.java:237) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.UltimateGraphMLWriter.save(UltimateGraphMLWriter.java:106) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.makeGraphMLString(CorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:165) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:131) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-28 13:12:47,967 INFO L168 Benchmark]: Toolchain (without parser) took 583263.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 236.5 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -267.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:12:47,967 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:12:47,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -208.0 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:12:47,968 INFO L168 Benchmark]: Boogie Preprocessor took 41.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:12:47,968 INFO L168 Benchmark]: RCFGBuilder took 332.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:12:47,968 INFO L168 Benchmark]: TraceAbstraction took 582495.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -119.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:12:47,968 INFO L168 Benchmark]: Witness Printer took 36.93 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 138.7 kB). Peak memory consumption was 138.7 kB. Max. memory is 11.5 GB. [2018-11-28 13:12:47,969 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -208.0 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 332.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 582495.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -119.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 36.93 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 138.7 kB). Peak memory consumption was 138.7 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 9 error locations. SAFE Result, 582.4s OverallTime, 22 OverallIterations, 8 TraceHistogramMax, 449.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 500 SDtfs, 1169 SDslu, 2749 SDs, 0 SdLazy, 3724 SolverSat, 351 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 47.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 918 GetRequests, 431 SyntacticMatches, 28 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3757 ImplicationChecksByTransitivity, 508.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=20, 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, 22 MinimizatonAttempts, 366 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 131.2s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 695 ConstructedInterpolants, 215 QuantifiedInterpolants, 865388 SizeOfPredicates, 258 NumberOfNonLiveVariables, 1803 ConjunctsInSsa, 415 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 280/514 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...