./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-635dfa2 [2018-12-09 01:35:50,009 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:35:50,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:35:50,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:35:50,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:35:50,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:35:50,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:35:50,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:35:50,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:35:50,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:35:50,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:35:50,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:35:50,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:35:50,020 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:35:50,021 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:35:50,021 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:35:50,022 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:35:50,023 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:35:50,024 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:35:50,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:35:50,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:35:50,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:35:50,026 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:35:50,027 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:35:50,027 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:35:50,027 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:35:50,028 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:35:50,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:35:50,028 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:35:50,029 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:35:50,029 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:35:50,030 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:35:50,030 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:35:50,030 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:35:50,030 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:35:50,031 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:35:50,031 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 01:35:50,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:35:50,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:35:50,038 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:35:50,038 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:35:50,039 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:35:50,039 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:35:50,039 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:35:50,039 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:35:50,039 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:35:50,039 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:35:50,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:35:50,040 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:35:50,040 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:35:50,040 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:35:50,040 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:35:50,040 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:35:50,040 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:35:50,040 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:35:50,040 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:35:50,041 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:35:50,041 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:35:50,041 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:35:50,041 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:35:50,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:35:50,041 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:35:50,041 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:35:50,042 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:35:50,042 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:35:50,042 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_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:35:50,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:35:50,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:35:50,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:35:50,068 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:35:50,068 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:35:50,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:35:50,103 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/data/62f93651f/0e4e8a90f85d435a86e216f582c227cd/FLAGe048509d7 [2018-12-09 01:35:50,514 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:35:50,515 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:35:50,521 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/data/62f93651f/0e4e8a90f85d435a86e216f582c227cd/FLAGe048509d7 [2018-12-09 01:35:50,529 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/data/62f93651f/0e4e8a90f85d435a86e216f582c227cd [2018-12-09 01:35:50,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:35:50,532 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 01:35:50,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:35:50,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:35:50,534 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:35:50,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:35:50" (1/1) ... [2018-12-09 01:35:50,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4834854b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:35:50, skipping insertion in model container [2018-12-09 01:35:50,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:35:50" (1/1) ... [2018-12-09 01:35:50,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:35:50,557 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:35:50,696 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:35:50,702 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:35:50,760 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:35:50,786 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:35:50,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:35:50 WrapperNode [2018-12-09 01:35:50,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:35:50,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:35:50,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:35:50,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:35:50,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:35:50" (1/1) ... [2018-12-09 01:35:50,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:35:50" (1/1) ... [2018-12-09 01:35:50,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:35:50" (1/1) ... [2018-12-09 01:35:50,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:35:50" (1/1) ... [2018-12-09 01:35:50,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:35:50" (1/1) ... [2018-12-09 01:35:50,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:35:50" (1/1) ... [2018-12-09 01:35:50,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:35:50" (1/1) ... [2018-12-09 01:35:50,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:35:50,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:35:50,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:35:50,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:35:50,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:35:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:35:50,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:35:50,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:35:50,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 01:35:50,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 01:35:50,851 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-12-09 01:35:50,851 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:35:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 01:35:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 01:35:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 01:35:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 01:35:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 01:35:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 01:35:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 01:35:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 01:35:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 01:35:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 01:35:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 01:35:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 01:35:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 01:35:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 01:35:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-12-09 01:35:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:35:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:35:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:35:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:35:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:35:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:35:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:35:51,071 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:35:51,072 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 01:35:51,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:35:51 BoogieIcfgContainer [2018-12-09 01:35:51,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:35:51,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:35:51,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:35:51,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:35:51,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:35:50" (1/3) ... [2018-12-09 01:35:51,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234c231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:35:51, skipping insertion in model container [2018-12-09 01:35:51,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:35:50" (2/3) ... [2018-12-09 01:35:51,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234c231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:35:51, skipping insertion in model container [2018-12-09 01:35:51,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:35:51" (3/3) ... [2018-12-09 01:35:51,078 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:35:51,085 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:35:51,091 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-09 01:35:51,102 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-09 01:35:51,118 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:35:51,118 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:35:51,119 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:35:51,119 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:35:51,119 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:35:51,119 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:35:51,119 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:35:51,119 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:35:51,119 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:35:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-09 01:35:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 01:35:51,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:51,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:35:51,137 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:51,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:51,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851682, now seen corresponding path program 1 times [2018-12-09 01:35:51,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:51,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:51,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:51,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:51,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:35:51,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:35:51,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:35:51,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:35:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:35:51,263 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-12-09 01:35:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:51,293 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-12-09 01:35:51,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:35:51,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 01:35:51,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:51,301 INFO L225 Difference]: With dead ends: 36 [2018-12-09 01:35:51,301 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 01:35:51,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:35:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 01:35:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 01:35:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 01:35:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-09 01:35:51,324 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2018-12-09 01:35:51,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:51,324 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-09 01:35:51,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:35:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-09 01:35:51,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 01:35:51,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:51,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:35:51,325 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:51,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:51,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851683, now seen corresponding path program 1 times [2018-12-09 01:35:51,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:51,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:51,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:35:51,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:35:51,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:35:51,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:35:51,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:35:51,364 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2018-12-09 01:35:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:51,379 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-09 01:35:51,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:35:51,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 01:35:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:51,380 INFO L225 Difference]: With dead ends: 32 [2018-12-09 01:35:51,380 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 01:35:51,380 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-12-09 01:35:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 01:35:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-09 01:35:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 01:35:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-09 01:35:51,382 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 10 [2018-12-09 01:35:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:51,382 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-09 01:35:51,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:35:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-09 01:35:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 01:35:51,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:51,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:35:51,383 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:51,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172715, now seen corresponding path program 1 times [2018-12-09 01:35:51,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:51,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:51,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:35:51,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:35:51,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:35:51,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:35:51,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:35:51,411 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2018-12-09 01:35:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:51,422 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-09 01:35:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:35:51,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 01:35:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:51,422 INFO L225 Difference]: With dead ends: 31 [2018-12-09 01:35:51,422 INFO L226 Difference]: Without dead ends: 31 [2018-12-09 01:35:51,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:35:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-09 01:35:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-09 01:35:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 01:35:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-09 01:35:51,424 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-12-09 01:35:51,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:51,425 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-09 01:35:51,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:35:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-09 01:35:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 01:35:51,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:51,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:35:51,425 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:51,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:51,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172714, now seen corresponding path program 1 times [2018-12-09 01:35:51,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:51,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:51,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:51,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:51,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:35:51,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:35:51,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:35:51,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:35:51,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:35:51,458 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-12-09 01:35:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:51,469 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-09 01:35:51,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:35:51,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 01:35:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:51,470 INFO L225 Difference]: With dead ends: 30 [2018-12-09 01:35:51,470 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 01:35:51,470 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-12-09 01:35:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 01:35:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 01:35:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 01:35:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-09 01:35:51,472 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-12-09 01:35:51,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:51,472 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-09 01:35:51,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:35:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-09 01:35:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:35:51,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:51,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:35:51,473 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:51,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:51,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020149, now seen corresponding path program 1 times [2018-12-09 01:35:51,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:51,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:51,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:51,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:51,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:35:51,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:35:51,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:35:51,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:35:51,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:35:51,507 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2018-12-09 01:35:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:51,543 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-12-09 01:35:51,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:35:51,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-09 01:35:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:51,544 INFO L225 Difference]: With dead ends: 29 [2018-12-09 01:35:51,544 INFO L226 Difference]: Without dead ends: 29 [2018-12-09 01:35:51,544 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-12-09 01:35:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-09 01:35:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-09 01:35:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 01:35:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-09 01:35:51,546 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-12-09 01:35:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:51,546 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-09 01:35:51,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:35:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-09 01:35:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:35:51,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:51,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:35:51,547 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:51,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:51,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020148, now seen corresponding path program 1 times [2018-12-09 01:35:51,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:51,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:51,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:51,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:51,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:35:51,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:35:51,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:35:51,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:35:51,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:35:51,613 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2018-12-09 01:35:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:51,672 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-09 01:35:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:35:51,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 01:35:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:51,673 INFO L225 Difference]: With dead ends: 32 [2018-12-09 01:35:51,673 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 01:35:51,674 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-12-09 01:35:51,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 01:35:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-09 01:35:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 01:35:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-09 01:35:51,677 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2018-12-09 01:35:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:51,677 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-09 01:35:51,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:35:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-09 01:35:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 01:35:51,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:51,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:35:51,678 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:51,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:51,679 INFO L82 PathProgramCache]: Analyzing trace with hash -820999840, now seen corresponding path program 1 times [2018-12-09 01:35:51,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:51,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:51,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:51,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:51,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:35:51,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:35:51,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:35:51,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:35:51,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:35:51,727 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2018-12-09 01:35:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:51,786 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-09 01:35:51,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:35:51,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-09 01:35:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:51,787 INFO L225 Difference]: With dead ends: 31 [2018-12-09 01:35:51,787 INFO L226 Difference]: Without dead ends: 31 [2018-12-09 01:35:51,787 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-12-09 01:35:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-09 01:35:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-09 01:35:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 01:35:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-09 01:35:51,789 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-12-09 01:35:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:51,789 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-09 01:35:51,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:35:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-09 01:35:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 01:35:51,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:51,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:35:51,790 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:51,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash -820999839, now seen corresponding path program 1 times [2018-12-09 01:35:51,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:51,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:51,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:35:51,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:35:51,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:35:51,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:35:51,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:35:51,859 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2018-12-09 01:35:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:51,930 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-12-09 01:35:51,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:35:51,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-12-09 01:35:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:51,931 INFO L225 Difference]: With dead ends: 34 [2018-12-09 01:35:51,931 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 01:35:51,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:35:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 01:35:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-09 01:35:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 01:35:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-09 01:35:51,933 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2018-12-09 01:35:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:51,933 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-09 01:35:51,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:35:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-09 01:35:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:35:51,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:51,934 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-12-09 01:35:51,934 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:51,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2018091976, now seen corresponding path program 1 times [2018-12-09 01:35:51,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:51,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:52,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:35:52,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 01:35:52,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 01:35:52,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 01:35:52,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:35:52,048 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 11 states. [2018-12-09 01:35:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:52,162 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-12-09 01:35:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:35:52,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-09 01:35:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:52,163 INFO L225 Difference]: With dead ends: 56 [2018-12-09 01:35:52,163 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 01:35:52,163 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-12-09 01:35:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 01:35:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-12-09 01:35:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 01:35:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-12-09 01:35:52,166 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-12-09 01:35:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:52,167 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-12-09 01:35:52,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 01:35:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-12-09 01:35:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:35:52,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:52,167 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-12-09 01:35:52,168 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:52,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:52,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2018089798, now seen corresponding path program 1 times [2018-12-09 01:35:52,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:52,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:52,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:52,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:52,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:52,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:35:52,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 01:35:52,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 01:35:52,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 01:35:52,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:35:52,262 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-12-09 01:35:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:52,393 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-12-09 01:35:52,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 01:35:52,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-09 01:35:52,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:52,395 INFO L225 Difference]: With dead ends: 94 [2018-12-09 01:35:52,395 INFO L226 Difference]: Without dead ends: 93 [2018-12-09 01:35:52,396 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-12-09 01:35:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-09 01:35:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-12-09 01:35:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-09 01:35:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-12-09 01:35:52,399 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-12-09 01:35:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:52,399 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-12-09 01:35:52,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 01:35:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-12-09 01:35:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:35:52,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:52,400 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-12-09 01:35:52,400 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:52,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:52,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1255809144, now seen corresponding path program 1 times [2018-12-09 01:35:52,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:52,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:52,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:52,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:52,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:52,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:35:52,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:35:52,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:52,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:35:52,628 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-12-09 01:35:52,630 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-12-09 01:35:52,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:35:52,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:35:52,640 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-12-09 01:35:52,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 01:35:52,779 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-12-09 01:35:52,786 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-12-09 01:35:52,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:35:52,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:35:52,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:35:52,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-09 01:35:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:52,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:35:52,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-12-09 01:35:52,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 01:35:52,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 01:35:52,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-12-09 01:35:52,869 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 20 states. [2018-12-09 01:35:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:54,898 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2018-12-09 01:35:54,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 01:35:54,899 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-12-09 01:35:54,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:54,899 INFO L225 Difference]: With dead ends: 122 [2018-12-09 01:35:54,900 INFO L226 Difference]: Without dead ends: 122 [2018-12-09 01:35:54,900 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-12-09 01:35:54,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-09 01:35:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 91. [2018-12-09 01:35:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 01:35:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-12-09 01:35:54,906 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 23 [2018-12-09 01:35:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:54,906 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-12-09 01:35:54,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 01:35:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-12-09 01:35:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:35:54,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:54,907 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-12-09 01:35:54,907 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:54,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash 688527418, now seen corresponding path program 1 times [2018-12-09 01:35:54,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:54,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:54,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:54,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:54,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:55,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:35:55,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:35:55,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:55,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:35:55,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:35:55,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:35:55,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:35:55,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 01:35:55,089 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-12-09 01:35:55,090 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-12-09 01:35:55,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:35:55,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:35:55,097 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-12-09 01:35:55,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 01:35:55,119 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-12-09 01:35:55,121 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-12-09 01:35:55,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:35:55,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:35:55,131 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-12-09 01:35:55,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 01:35:55,240 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-12-09 01:35:55,243 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-12-09 01:35:55,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:35:55,258 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-12-09 01:35:55,258 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:35:55,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:35:55,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:35:55,274 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-12-09 01:35:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:55,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:35:55,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-12-09 01:35:55,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 01:35:55,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 01:35:55,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-12-09 01:35:55,366 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 22 states. [2018-12-09 01:35:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:56,413 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-12-09 01:35:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 01:35:56,413 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-12-09 01:35:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:56,414 INFO L225 Difference]: With dead ends: 121 [2018-12-09 01:35:56,414 INFO L226 Difference]: Without dead ends: 121 [2018-12-09 01:35:56,414 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-12-09 01:35:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-09 01:35:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2018-12-09 01:35:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 01:35:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2018-12-09 01:35:56,418 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 23 [2018-12-09 01:35:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:56,418 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2018-12-09 01:35:56,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 01:35:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2018-12-09 01:35:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:35:56,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:56,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:35:56,419 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:56,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1863036971, now seen corresponding path program 1 times [2018-12-09 01:35:56,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:56,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:56,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:56,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:56,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:56,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:35:56,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:35:56,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:35:56,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:35:56,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:35:56,460 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 4 states. [2018-12-09 01:35:56,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:56,493 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2018-12-09 01:35:56,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:35:56,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-09 01:35:56,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:56,493 INFO L225 Difference]: With dead ends: 113 [2018-12-09 01:35:56,493 INFO L226 Difference]: Without dead ends: 91 [2018-12-09 01:35:56,494 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-12-09 01:35:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-09 01:35:56,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-09 01:35:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 01:35:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-12-09 01:35:56,498 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2018-12-09 01:35:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:56,498 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-12-09 01:35:56,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:35:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-12-09 01:35:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 01:35:56,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:56,499 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-12-09 01:35:56,499 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:56,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:56,500 INFO L82 PathProgramCache]: Analyzing trace with hash -728587261, now seen corresponding path program 2 times [2018-12-09 01:35:56,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:56,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:56,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:56,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:35:56,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:56,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:35:56,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:35:56,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:35:56,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:35:56,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:35:56,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:35:56,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:35:56,743 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-12-09 01:35:56,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:35:56,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:35:56,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:35:56,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 01:35:56,767 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-12-09 01:35:56,769 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-12-09 01:35:56,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:35:56,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:35:56,774 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-12-09 01:35:56,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-09 01:35:56,928 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-12-09 01:35:56,933 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-12-09 01:35:56,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:35:56,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:35:56,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:35:56,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-12-09 01:35:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:57,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:35:57,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-12-09 01:35:57,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 01:35:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 01:35:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-12-09 01:35:57,017 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 24 states. [2018-12-09 01:35:57,683 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-12-09 01:35:58,057 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-12-09 01:35:58,282 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2018-12-09 01:35:58,504 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2018-12-09 01:35:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:35:58,607 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-12-09 01:35:58,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 01:35:58,607 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-09 01:35:58,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:35:58,608 INFO L225 Difference]: With dead ends: 102 [2018-12-09 01:35:58,608 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 01:35:58,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 01:35:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 01:35:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2018-12-09 01:35:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 01:35:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-09 01:35:58,611 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 28 [2018-12-09 01:35:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:35:58,612 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-09 01:35:58,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 01:35:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-12-09 01:35:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 01:35:58,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:35:58,612 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-12-09 01:35:58,613 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 01:35:58,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:35:58,613 INFO L82 PathProgramCache]: Analyzing trace with hash -88962970, now seen corresponding path program 2 times [2018-12-09 01:35:58,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:35:58,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:35:58,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:58,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:35:58,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:35:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:35:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:58,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:35:58,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:35:58,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:35:58,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:35:58,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:35:58,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:35:58,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:35:58,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:35:58,835 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-12-09 01:35:58,837 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-12-09 01:35:58,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:35:58,841 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:35:58,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:35:58,852 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 01:35:58,869 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-12-09 01:35:58,870 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-12-09 01:35:58,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:35:58,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:35:58,877 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-12-09 01:35:58,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-09 01:35:58,898 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-12-09 01:35:58,900 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-12-09 01:35:58,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:35:58,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:35:58,909 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-12-09 01:35:58,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-12-09 01:35:59,289 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-12-09 01:35:59,291 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-12-09 01:35:59,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:35:59,300 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-12-09 01:35:59,300 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:35:59,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:35:59,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:35:59,310 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-12-09 01:35:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:35:59,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:35:59,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-12-09 01:35:59,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 01:35:59,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 01:35:59,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-12-09 01:35:59,414 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 25 states. [2018-12-09 01:36:00,599 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-12-09 01:36:03,701 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-09 01:36:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:05,525 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-12-09 01:36:05,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 01:36:05,526 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-12-09 01:36:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:05,526 INFO L225 Difference]: With dead ends: 62 [2018-12-09 01:36:05,526 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 01:36:05,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=206, Invalid=1353, Unknown=1, NotChecked=0, Total=1560 [2018-12-09 01:36:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 01:36:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 01:36:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 01:36:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 01:36:05,527 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-12-09 01:36:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:05,527 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:36:05,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 01:36:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:36:05,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 01:36:05,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:36:05 BoogieIcfgContainer [2018-12-09 01:36:05,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:36:05,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:36:05,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:36:05,531 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:36:05,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:35:51" (3/4) ... [2018-12-09 01:36:05,533 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 01:36:05,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 01:36:05,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2018-12-09 01:36:05,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 01:36:05,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 01:36:05,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 01:36:05,539 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-09 01:36:05,539 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 01:36:05,540 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 01:36:05,560 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-12-09 01:36:05,562 INFO L168 Benchmark]: Toolchain (without parser) took 15031.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -201.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:36:05,563 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:36:05,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:36:05,563 INFO L168 Benchmark]: Boogie Preprocessor took 30.59 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:36:05,564 INFO L168 Benchmark]: RCFGBuilder took 254.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:36:05,564 INFO L168 Benchmark]: TraceAbstraction took 14457.27 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -123.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:36:05,564 INFO L168 Benchmark]: Witness Printer took 31.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:36:05,565 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.59 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 254.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14457.27 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -123.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 31.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. 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: 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: 566]: 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 - 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.4s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 642 SDslu, 1766 SDs, 0 SdLazy, 1771 SolverSat, 164 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 8.0s 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.5s 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-635dfa2 [2018-12-09 01:36:06,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:36:06,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:36:06,833 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:36:06,833 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:36:06,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:36:06,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:36:06,835 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:36:06,836 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:36:06,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:36:06,837 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:36:06,837 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:36:06,838 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:36:06,839 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:36:06,839 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:36:06,839 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:36:06,840 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:36:06,841 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:36:06,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:36:06,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:36:06,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:36:06,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:36:06,845 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:36:06,845 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:36:06,846 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:36:06,846 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:36:06,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:36:06,847 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:36:06,847 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:36:06,848 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:36:06,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:36:06,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:36:06,848 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:36:06,848 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:36:06,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:36:06,849 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:36:06,849 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-09 01:36:06,858 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:36:06,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:36:06,859 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:36:06,859 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:36:06,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:36:06,860 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:36:06,860 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:36:06,860 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:36:06,860 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:36:06,860 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:36:06,861 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:36:06,861 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:36:06,861 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:36:06,861 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:36:06,861 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:36:06,861 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:36:06,861 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:36:06,861 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 01:36:06,862 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 01:36:06,862 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:36:06,862 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:36:06,862 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:36:06,862 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:36:06,862 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:36:06,862 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:36:06,863 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:36:06,863 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:36:06,863 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:36:06,863 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-09 01:36:06,863 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:36:06,863 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 01:36:06,863 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_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:06,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:36:06,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:36:06,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:36:06,897 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:36:06,897 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:36:06,897 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:36:06,935 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/data/d381afd04/635326da96684288bf14c38cf6739260/FLAGe81f3656c [2018-12-09 01:36:07,379 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:36:07,380 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:36:07,385 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/data/d381afd04/635326da96684288bf14c38cf6739260/FLAGe81f3656c [2018-12-09 01:36:07,393 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/data/d381afd04/635326da96684288bf14c38cf6739260 [2018-12-09 01:36:07,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:36:07,396 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 01:36:07,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:36:07,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:36:07,398 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:36:07,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:36:07" (1/1) ... [2018-12-09 01:36:07,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f9983a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:36:07, skipping insertion in model container [2018-12-09 01:36:07,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:36:07" (1/1) ... [2018-12-09 01:36:07,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:36:07,422 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:36:07,570 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:36:07,578 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:36:07,604 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:36:07,670 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:36:07,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:36:07 WrapperNode [2018-12-09 01:36:07,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:36:07,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:36:07,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:36:07,671 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:36:07,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:36:07" (1/1) ... [2018-12-09 01:36:07,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:36:07" (1/1) ... [2018-12-09 01:36:07,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:36:07" (1/1) ... [2018-12-09 01:36:07,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:36:07" (1/1) ... [2018-12-09 01:36:07,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:36:07" (1/1) ... [2018-12-09 01:36:07,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:36:07" (1/1) ... [2018-12-09 01:36:07,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:36:07" (1/1) ... [2018-12-09 01:36:07,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:36:07,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:36:07,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:36:07,703 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:36:07,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:36:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:36:07,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:36:07,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:36:07,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 01:36:07,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 01:36:07,734 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-12-09 01:36:07,734 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:36:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 01:36:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 01:36:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 01:36:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 01:36:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 01:36:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 01:36:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 01:36:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 01:36:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 01:36:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 01:36:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 01:36:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 01:36:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 01:36:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 01:36:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 01:36:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 01:36:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 01:36:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 01:36:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 01:36:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 01:36:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 01:36:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:36:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:36:07,968 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:36:07,968 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 01:36:07,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:36:07 BoogieIcfgContainer [2018-12-09 01:36:07,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:36:07,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:36:07,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:36:07,971 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:36:07,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:36:07" (1/3) ... [2018-12-09 01:36:07,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c4ff6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:36:07, skipping insertion in model container [2018-12-09 01:36:07,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:36:07" (2/3) ... [2018-12-09 01:36:07,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c4ff6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:36:07, skipping insertion in model container [2018-12-09 01:36:07,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:36:07" (3/3) ... [2018-12-09 01:36:07,973 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:36:07,979 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:36:07,983 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-09 01:36:07,992 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-09 01:36:08,006 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:36:08,007 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:36:08,007 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:36:08,007 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:36:08,007 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:36:08,007 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:36:08,007 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:36:08,007 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:36:08,007 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:36:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-09 01:36:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 01:36:08,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:08,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:08,021 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:08,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:08,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851682, now seen corresponding path program 1 times [2018-12-09 01:36:08,027 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:08,027 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:08,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:08,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:08,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:36:08,118 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-12-09 01:36:08,122 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-12-09 01:36:08,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:08,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-09 01:36:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:08,151 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:08,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:08,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:36:08,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:36:08,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:36:08,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:36:08,165 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-12-09 01:36:08,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:08,215 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-12-09 01:36:08,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:36:08,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 01:36:08,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:08,221 INFO L225 Difference]: With dead ends: 36 [2018-12-09 01:36:08,221 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 01:36:08,222 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-12-09 01:36:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 01:36:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 01:36:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 01:36:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-09 01:36:08,243 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2018-12-09 01:36:08,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:08,244 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-09 01:36:08,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:36:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-09 01:36:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 01:36:08,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:08,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:08,244 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:08,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:08,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851683, now seen corresponding path program 1 times [2018-12-09 01:36:08,245 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:08,245 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:08,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:08,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:08,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:36:08,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,333 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-12-09 01:36:08,339 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-12-09 01:36:08,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,365 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2018-12-09 01:36:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:08,373 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:08,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:08,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:36:08,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:36:08,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:36:08,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:36:08,376 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2018-12-09 01:36:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:08,411 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-09 01:36:08,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:36:08,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 01:36:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:08,413 INFO L225 Difference]: With dead ends: 43 [2018-12-09 01:36:08,414 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 01:36:08,414 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-12-09 01:36:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 01:36:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-12-09 01:36:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 01:36:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-09 01:36:08,421 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 10 [2018-12-09 01:36:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:08,422 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-09 01:36:08,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:36:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-09 01:36:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 01:36:08,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:08,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:08,422 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:08,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:08,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1757911265, now seen corresponding path program 1 times [2018-12-09 01:36:08,423 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:08,423 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:08,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:08,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:08,500 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-12-09 01:36:08,506 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-12-09 01:36:08,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:36:08,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,554 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:13 [2018-12-09 01:36:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:08,566 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:08,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:08,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:36:08,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:36:08,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:36:08,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:36:08,568 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 4 states. [2018-12-09 01:36:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:08,604 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-09 01:36:08,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:36:08,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 01:36:08,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:08,605 INFO L225 Difference]: With dead ends: 35 [2018-12-09 01:36:08,605 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 01:36:08,606 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-12-09 01:36:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 01:36:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-12-09 01:36:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 01:36:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-09 01:36:08,609 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 10 [2018-12-09 01:36:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:08,609 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-09 01:36:08,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:36:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-09 01:36:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 01:36:08,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:08,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:08,610 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:08,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172715, now seen corresponding path program 1 times [2018-12-09 01:36:08,611 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:08,611 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:08,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:08,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:08,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:36:08,657 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-12-09 01:36:08,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:08,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-09 01:36:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:08,679 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:08,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:08,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:36:08,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:36:08,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:36:08,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:36:08,681 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2018-12-09 01:36:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:08,714 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-09 01:36:08,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:36:08,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 01:36:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:08,715 INFO L225 Difference]: With dead ends: 31 [2018-12-09 01:36:08,715 INFO L226 Difference]: Without dead ends: 31 [2018-12-09 01:36:08,715 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-12-09 01:36:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-09 01:36:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-09 01:36:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 01:36:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-09 01:36:08,717 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-12-09 01:36:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:08,718 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-09 01:36:08,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:36:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-09 01:36:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 01:36:08,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:08,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:08,718 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:08,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:08,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172714, now seen corresponding path program 1 times [2018-12-09 01:36:08,719 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:08,719 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:08,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:08,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:08,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:36:08,775 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-12-09 01:36:08,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:36:08,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:36:08,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2018-12-09 01:36:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:08,810 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:08,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:08,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:36:08,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:36:08,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:36:08,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:36:08,811 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-12-09 01:36:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:08,839 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-09 01:36:08,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:36:08,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 01:36:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:08,840 INFO L225 Difference]: With dead ends: 38 [2018-12-09 01:36:08,840 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 01:36:08,840 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-12-09 01:36:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 01:36:08,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-12-09 01:36:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 01:36:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-12-09 01:36:08,843 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2018-12-09 01:36:08,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:08,843 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-12-09 01:36:08,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:36:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-12-09 01:36:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 01:36:08,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:08,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:08,844 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:08,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1341113132, now seen corresponding path program 1 times [2018-12-09 01:36:08,844 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:08,844 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:08,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:08,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:08,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:36:08,910 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-12-09 01:36:08,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:36:08,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:36:08,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:08,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2018-12-09 01:36:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:08,954 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:08,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:08,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:36:08,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:36:08,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:36:08,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:36:08,955 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2018-12-09 01:36:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:08,992 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-12-09 01:36:08,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:36:08,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 01:36:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:08,993 INFO L225 Difference]: With dead ends: 33 [2018-12-09 01:36:08,994 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 01:36:08,994 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-12-09 01:36:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 01:36:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-12-09 01:36:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 01:36:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-09 01:36:08,996 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-12-09 01:36:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:08,996 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-09 01:36:08,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:36:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-09 01:36:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:36:08,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:08,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:08,996 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:08,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:08,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020149, now seen corresponding path program 1 times [2018-12-09 01:36:08,997 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:08,997 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:09,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:09,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:09,066 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:09,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:09,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:36:09,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:36:09,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:36:09,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:36:09,068 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2018-12-09 01:36:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:09,152 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-12-09 01:36:09,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:36:09,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-09 01:36:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:09,153 INFO L225 Difference]: With dead ends: 29 [2018-12-09 01:36:09,153 INFO L226 Difference]: Without dead ends: 29 [2018-12-09 01:36:09,153 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-12-09 01:36:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-09 01:36:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-09 01:36:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 01:36:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-09 01:36:09,155 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-12-09 01:36:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:09,155 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-09 01:36:09,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:36:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-09 01:36:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:36:09,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:09,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:09,156 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:09,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:09,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020148, now seen corresponding path program 1 times [2018-12-09 01:36:09,156 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:09,156 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:09,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:09,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:09,285 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:09,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:09,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:36:09,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:36:09,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:36:09,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:36:09,287 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2018-12-09 01:36:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:09,541 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-12-09 01:36:09,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:36:09,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 01:36:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:09,542 INFO L225 Difference]: With dead ends: 54 [2018-12-09 01:36:09,543 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 01:36:09,543 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-12-09 01:36:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 01:36:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-12-09 01:36:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 01:36:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-12-09 01:36:09,546 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2018-12-09 01:36:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:09,546 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-12-09 01:36:09,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:36:09,546 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-12-09 01:36:09,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:36:09,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:09,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:09,547 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:09,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:09,547 INFO L82 PathProgramCache]: Analyzing trace with hash -636961778, now seen corresponding path program 1 times [2018-12-09 01:36:09,547 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:09,547 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:09,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:09,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:09,707 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:09,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:09,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:36:09,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:36:09,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:36:09,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:36:09,710 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 8 states. [2018-12-09 01:36:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:09,996 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-12-09 01:36:09,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:36:09,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 01:36:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:09,998 INFO L225 Difference]: With dead ends: 51 [2018-12-09 01:36:09,998 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 01:36:09,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:36:09,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 01:36:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2018-12-09 01:36:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 01:36:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-09 01:36:10,001 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2018-12-09 01:36:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:10,001 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-09 01:36:10,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:36:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-09 01:36:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 01:36:10,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:10,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:10,002 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:10,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash -820999840, now seen corresponding path program 1 times [2018-12-09 01:36:10,002 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:10,002 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:10,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:10,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:10,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:36:10,060 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-12-09 01:36:10,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:10,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:10,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:10,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-09 01:36:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:10,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:10,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:10,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:36:10,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:36:10,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:36:10,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:36:10,103 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2018-12-09 01:36:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:10,221 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-09 01:36:10,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:36:10,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-09 01:36:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:10,222 INFO L225 Difference]: With dead ends: 31 [2018-12-09 01:36:10,222 INFO L226 Difference]: Without dead ends: 31 [2018-12-09 01:36:10,222 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-12-09 01:36:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-09 01:36:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-09 01:36:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 01:36:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-09 01:36:10,224 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-12-09 01:36:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:10,224 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-09 01:36:10,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:36:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-09 01:36:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 01:36:10,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:10,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:10,225 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:10,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash -820999839, now seen corresponding path program 1 times [2018-12-09 01:36:10,225 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:10,225 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:10,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:10,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:10,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:36:10,304 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-12-09 01:36:10,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:36:10,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:36:10,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:10,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 01:36:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:10,379 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:10,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:10,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:36:10,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:36:10,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:36:10,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:36:10,381 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2018-12-09 01:36:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:10,557 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-12-09 01:36:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:36:10,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 01:36:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:10,558 INFO L225 Difference]: With dead ends: 56 [2018-12-09 01:36:10,559 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 01:36:10,559 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-12-09 01:36:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 01:36:10,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-12-09 01:36:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 01:36:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-12-09 01:36:10,562 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 18 [2018-12-09 01:36:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:10,562 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-12-09 01:36:10,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:36:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-12-09 01:36:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 01:36:10,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:10,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:10,563 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:10,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash -119935261, now seen corresponding path program 1 times [2018-12-09 01:36:10,564 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:10,564 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:10,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:10,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:10,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:36:10,648 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-12-09 01:36:10,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:36:10,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:36:10,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:10,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2018-12-09 01:36:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:10,752 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:10,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:10,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:36:10,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:36:10,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:36:10,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:36:10,754 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 8 states. [2018-12-09 01:36:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:10,981 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-12-09 01:36:10,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:36:10,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 01:36:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:10,983 INFO L225 Difference]: With dead ends: 55 [2018-12-09 01:36:10,983 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 01:36:10,983 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-12-09 01:36:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 01:36:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-12-09 01:36:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 01:36:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-09 01:36:10,986 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2018-12-09 01:36:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:10,986 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-09 01:36:10,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:36:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-09 01:36:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:36:10,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:10,986 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-12-09 01:36:10,986 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:10,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:10,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2018091976, now seen corresponding path program 1 times [2018-12-09 01:36:10,987 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:10,987 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:11,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:11,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:11,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:36:11,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:11,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:11,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 01:36:11,101 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-12-09 01:36:11,103 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-12-09 01:36:11,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:11,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:11,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:11,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 01:36:11,130 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-12-09 01:36:11,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 01:36:11,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:11,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:11,157 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-12-09 01:36:11,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2018-12-09 01:36:11,272 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-12-09 01:36:11,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-09 01:36:11,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:11,280 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-12-09 01:36:11,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:11,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:11,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:11,284 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-12-09 01:36:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:11,328 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:11,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:11,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 01:36:11,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:36:11,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:36:11,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:36:11,330 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2018-12-09 01:36:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:11,991 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-12-09 01:36:11,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:36:11,992 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-12-09 01:36:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:11,993 INFO L225 Difference]: With dead ends: 56 [2018-12-09 01:36:11,993 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 01:36:11,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-12-09 01:36:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 01:36:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-12-09 01:36:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 01:36:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-12-09 01:36:11,995 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-12-09 01:36:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:11,995 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-12-09 01:36:11,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:36:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-12-09 01:36:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:36:11,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:11,996 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-12-09 01:36:11,996 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:11,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:11,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2018089798, now seen corresponding path program 1 times [2018-12-09 01:36:11,996 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:11,996 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:12,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:12,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:12,082 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-12-09 01:36:12,083 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-12-09 01:36:12,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:12,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:12,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:12,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-09 01:36:12,131 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-12-09 01:36:12,132 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-12-09 01:36:12,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:12,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:12,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:12,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-09 01:36:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:12,158 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:12,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:12,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 01:36:12,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 01:36:12,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 01:36:12,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:36:12,160 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-12-09 01:36:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:12,483 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-12-09 01:36:12,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 01:36:12,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-09 01:36:12,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:12,483 INFO L225 Difference]: With dead ends: 94 [2018-12-09 01:36:12,483 INFO L226 Difference]: Without dead ends: 93 [2018-12-09 01:36:12,484 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-12-09 01:36:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-09 01:36:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-12-09 01:36:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-09 01:36:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-12-09 01:36:12,487 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-12-09 01:36:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:12,487 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-12-09 01:36:12,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 01:36:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-12-09 01:36:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:36:12,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:12,487 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-12-09 01:36:12,488 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:12,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:12,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1255809144, now seen corresponding path program 1 times [2018-12-09 01:36:12,488 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:12,488 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:12,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:12,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:12,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:36:12,580 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-12-09 01:36:12,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:36:12,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:36:12,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:12,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2018-12-09 01:36:12,625 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-12-09 01:36:12,628 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-12-09 01:36:12,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:12,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:12,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:12,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2018-12-09 01:36:12,864 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-12-09 01:36:12,875 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-12-09 01:36:12,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:36:12,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:36:12,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:36:12,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:38 [2018-12-09 01:36:13,093 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-09 01:36:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:13,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:36:14,129 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-12-09 01:36:14,201 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-12-09 01:36:14,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:14,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:14,238 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-12-09 01:36:14,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 01:36:14,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:14,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:14,374 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-12-09 01:36:14,433 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-12-09 01:36:14,435 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:14,453 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:14,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:36:14,526 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:119, output treesize:77 [2018-12-09 01:36:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:14,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:36:14,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-12-09 01:36:14,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 01:36:14,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 01:36:14,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-09 01:36:14,781 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 23 states. [2018-12-09 01:36:15,054 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-09 01:36:15,753 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-09 01:36:15,975 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-12-09 01:36:16,268 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-09 01:36:16,571 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-09 01:36:21,625 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 01:36:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:21,670 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2018-12-09 01:36:21,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 01:36:21,672 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-09 01:36:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:21,672 INFO L225 Difference]: With dead ends: 105 [2018-12-09 01:36:21,672 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 01:36:21,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 01:36:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 01:36:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2018-12-09 01:36:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 01:36:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-12-09 01:36:21,676 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 23 [2018-12-09 01:36:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:21,676 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-12-09 01:36:21,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 01:36:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-12-09 01:36:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:36:21,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:21,677 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-12-09 01:36:21,677 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:21,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:21,677 INFO L82 PathProgramCache]: Analyzing trace with hash 688527418, now seen corresponding path program 1 times [2018-12-09 01:36:21,677 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:21,677 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:21,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:21,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:21,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:36:21,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:21,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:21,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 01:36:21,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 01:36:21,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 01:36:21,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:21,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:21,845 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-12-09 01:36:21,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:36 [2018-12-09 01:36:21,890 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-12-09 01:36:21,893 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-12-09 01:36:21,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:21,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:21,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:21,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-12-09 01:36:22,082 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-12-09 01:36:22,093 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-12-09 01:36:22,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:36:22,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:36:22,123 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-12-09 01:36:22,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-12-09 01:36:22,385 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-12-09 01:36:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:22,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:36:24,393 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-12-09 01:36:24,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:24,648 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-12-09 01:36:24,649 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:24,905 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-12-09 01:36:24,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:25,165 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-12-09 01:36:25,283 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-09 01:36:25,288 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-12-09 01:36:25,288 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:25,336 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-12-09 01:36:25,343 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:36:25,343 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:36:25,344 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-12-09 01:36:25,345 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:25,358 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:25,403 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-12-09 01:36:25,685 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-12-09 01:36:25,825 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2018-12-09 01:36:25,832 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-12-09 01:36:25,833 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:25,884 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-12-09 01:36:25,896 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:36:25,897 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:36:25,898 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-12-09 01:36:25,898 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:25,913 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:25,964 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-12-09 01:36:26,339 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-12-09 01:36:26,473 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-12-09 01:36:26,481 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-12-09 01:36:26,481 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:26,545 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-12-09 01:36:28,551 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-12-09 01:36:28,554 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:36:28,555 INFO L303 Elim1Store]: Index analysis took 2008 ms [2018-12-09 01:36:28,555 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-12-09 01:36:28,556 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:28,571 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:36:28,625 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-12-09 01:36:28,951 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-12-09 01:36:28,951 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:245, output treesize:206 [2018-12-09 01:36:29,728 WARN L180 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2018-12-09 01:36:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:29,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:36:29,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2018-12-09 01:36:29,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 01:36:29,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 01:36:29,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-12-09 01:36:29,922 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 27 states. [2018-12-09 01:36:30,352 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 01:36:31,332 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-12-09 01:36:32,138 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-12-09 01:36:32,666 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-12-09 01:36:33,269 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-12-09 01:36:33,617 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-12-09 01:36:34,455 WARN L180 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2018-12-09 01:36:35,050 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-09 01:36:35,613 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-09 01:36:35,940 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2018-12-09 01:36:37,617 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 01:36:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:36:37,990 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-12-09 01:36:37,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 01:36:37,991 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-12-09 01:36:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:36:37,992 INFO L225 Difference]: With dead ends: 124 [2018-12-09 01:36:37,992 INFO L226 Difference]: Without dead ends: 124 [2018-12-09 01:36:37,993 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-12-09 01:36:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-09 01:36:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2018-12-09 01:36:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 01:36:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2018-12-09 01:36:37,996 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 23 [2018-12-09 01:36:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:36:37,996 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2018-12-09 01:36:37,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 01:36:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2018-12-09 01:36:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:36:37,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:36:37,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:36:37,997 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:36:37,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:36:37,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1863036971, now seen corresponding path program 1 times [2018-12-09 01:36:37,998 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:36:37,998 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:36:38,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:36:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:36:38,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:36:38,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:36:38,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:38,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:36:38,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:36:38,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:36:38,119 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-12-09 01:36:38,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:36:38,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:36:38,122 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-12-09 01:36:38,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:38,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:36:38,140 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-12-09 01:36:38,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:36:38,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:36:38,162 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-12-09 01:36:38,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:38 [2018-12-09 01:36:43,591 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 01:36:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:36:43,593 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:36:43,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:36:43,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:36:43,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:36:43,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:36:43,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2018-12-09 01:36:43,596 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 7 states. [2018-12-09 01:37:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:37:05,869 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2018-12-09 01:37:05,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:37:05,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-09 01:37:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:37:05,870 INFO L225 Difference]: With dead ends: 113 [2018-12-09 01:37:05,870 INFO L226 Difference]: Without dead ends: 91 [2018-12-09 01:37:05,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=25, Invalid=45, Unknown=2, NotChecked=0, Total=72 [2018-12-09 01:37:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-09 01:37:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-09 01:37:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 01:37:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-12-09 01:37:05,872 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2018-12-09 01:37:05,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:37:05,872 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-12-09 01:37:05,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:37:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-12-09 01:37:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 01:37:05,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:37:05,873 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-12-09 01:37:05,873 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:37:05,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:37:05,873 INFO L82 PathProgramCache]: Analyzing trace with hash -728587261, now seen corresponding path program 2 times [2018-12-09 01:37:05,874 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:37:05,874 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:37:05,889 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 01:37:05,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:37:05,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:37:05,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:37:06,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:37:06,009 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-12-09 01:37:06,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:06,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:37:06,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:37:06,034 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:06,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:37:06,050 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-12-09 01:37:06,075 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-12-09 01:37:06,077 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-12-09 01:37:06,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:06,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:37:06,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:37:06,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-12-09 01:37:06,131 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-12-09 01:37:06,135 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-12-09 01:37:06,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:06,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:37:06,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:37:06,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:50 [2018-12-09 01:37:06,673 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-12-09 01:37:06,676 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-12-09 01:37:06,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:06,694 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-12-09 01:37:06,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:37:06,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:37:06,722 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-12-09 01:37:06,722 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-12-09 01:37:06,981 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-12-09 01:37:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:37:07,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:37:08,946 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-12-09 01:37:08,952 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-12-09 01:37:08,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:09,013 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-12-09 01:37:09,094 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-12-09 01:37:09,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:09,136 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-12-09 01:37:09,137 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:11,166 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-12-09 01:37:11,170 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:37:11,171 INFO L303 Elim1Store]: Index analysis took 2011 ms [2018-12-09 01:37:11,172 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-12-09 01:37:11,173 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:11,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:37:11,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:37:11,240 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-12-09 01:37:11,252 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-12-09 01:37:11,252 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:11,324 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-12-09 01:37:11,398 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-12-09 01:37:11,399 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:11,445 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-12-09 01:37:11,446 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:13,495 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-12-09 01:37:13,499 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:37:13,500 INFO L303 Elim1Store]: Index analysis took 2016 ms [2018-12-09 01:37:13,500 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-12-09 01:37:13,502 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:13,530 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:37:13,592 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:37:13,609 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-12-09 01:37:13,623 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-12-09 01:37:13,623 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:13,727 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-12-09 01:37:13,816 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-12-09 01:37:13,816 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:13,883 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:37:13,884 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:37:13,885 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-12-09 01:37:13,886 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:13,935 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-12-09 01:37:13,936 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:13,965 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:37:14,038 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:37:14,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-09 01:37:14,277 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:185, output treesize:242 [2018-12-09 01:37:14,790 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 01:37:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:37:14,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:37:14,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2018-12-09 01:37:14,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 01:37:14,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 01:37:14,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2018-12-09 01:37:14,805 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 30 states. [2018-12-09 01:37:15,348 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-09 01:37:16,209 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-09 01:37:17,429 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-12-09 01:37:17,948 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-09 01:37:18,561 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2018-12-09 01:37:19,095 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-12-09 01:37:20,430 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2018-12-09 01:37:21,032 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-09 01:37:21,673 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2018-12-09 01:37:22,112 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2018-12-09 01:37:22,487 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-12-09 01:37:23,012 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-09 01:37:23,450 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-09 01:37:24,004 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-09 01:37:24,495 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-12-09 01:37:25,556 WARN L180 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2018-12-09 01:37:26,155 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-12-09 01:37:27,111 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2018-12-09 01:37:29,612 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-12-09 01:37:30,046 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 01:37:30,444 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-12-09 01:37:30,994 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 01:37:31,498 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-12-09 01:37:32,052 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 01:37:32,614 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-12-09 01:37:33,202 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2018-12-09 01:37:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:37:34,546 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2018-12-09 01:37:34,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-09 01:37:34,548 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 28 [2018-12-09 01:37:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:37:34,548 INFO L225 Difference]: With dead ends: 118 [2018-12-09 01:37:34,548 INFO L226 Difference]: Without dead ends: 118 [2018-12-09 01:37:34,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=576, Invalid=3584, Unknown=0, NotChecked=0, Total=4160 [2018-12-09 01:37:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-09 01:37:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2018-12-09 01:37:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 01:37:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2018-12-09 01:37:34,552 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 28 [2018-12-09 01:37:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:37:34,552 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-12-09 01:37:34,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 01:37:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2018-12-09 01:37:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 01:37:34,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:37:34,552 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-12-09 01:37:34,553 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:37:34,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:37:34,553 INFO L82 PathProgramCache]: Analyzing trace with hash -88962970, now seen corresponding path program 2 times [2018-12-09 01:37:34,553 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:37:34,553 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:37:34,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:37:34,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:37:34,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:37:34,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:37:34,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:37:34,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:34,698 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-12-09 01:37:34,703 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-12-09 01:37:34,704 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:34,711 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:37:34,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:37:34,724 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-12-09 01:37:34,752 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-12-09 01:37:34,758 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-12-09 01:37:34,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:34,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:37:34,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:37:34,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-12-09 01:37:34,852 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-12-09 01:37:34,856 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-12-09 01:37:34,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:34,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:37:34,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:37:34,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-12-09 01:37:35,288 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-12-09 01:37:35,299 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-12-09 01:37:35,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:37:35,327 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-12-09 01:37:35,327 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:35,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:37:35,362 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-12-09 01:37:35,363 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2018-12-09 01:37:35,571 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-09 01:37:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:37:35,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:37:38,118 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-12-09 01:37:38,235 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-12-09 01:37:38,246 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-12-09 01:37:38,246 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:37:38,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:37:38,439 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-12-09 01:37:38,532 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-12-09 01:37:38,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:37:38,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:37:38,705 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-12-09 01:37:38,824 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2018-12-09 01:37:38,832 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-12-09 01:37:38,832 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:37:38,888 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:37:39,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:37:39,018 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:191, output treesize:109 [2018-12-09 01:37:39,340 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 01:37:39,345 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 01:37:39,345 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:60, output treesize:1 [2018-12-09 01:37:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:37:39,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:37:39,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2018-12-09 01:37:39,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 01:37:39,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 01:37:39,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-12-09 01:37:39,354 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 26 states. [2018-12-09 01:37:41,031 WARN L180 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-12-09 01:37:42,486 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2018-12-09 01:37:43,637 WARN L180 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2018-12-09 01:37:45,419 WARN L180 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-12-09 01:37:47,001 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-12-09 01:37:47,402 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-12-09 01:37:47,984 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-09 01:37:48,488 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-12-09 01:37:49,900 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2018-12-09 01:37:50,693 WARN L180 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2018-12-09 01:37:51,120 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2018-12-09 01:37:52,207 WARN L180 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2018-12-09 01:37:53,301 WARN L180 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2018-12-09 01:37:55,965 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-12-09 01:37:56,639 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-12-09 01:37:57,100 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-12-09 01:37:58,873 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-12-09 01:38:01,699 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2018-12-09 01:38:02,584 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 01:38:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:38:04,044 INFO L93 Difference]: Finished difference Result 199 states and 218 transitions. [2018-12-09 01:38:04,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 01:38:04,046 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2018-12-09 01:38:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:38:04,046 INFO L225 Difference]: With dead ends: 199 [2018-12-09 01:38:04,046 INFO L226 Difference]: Without dead ends: 199 [2018-12-09 01:38:04,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=370, Invalid=2178, Unknown=2, NotChecked=0, Total=2550 [2018-12-09 01:38:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-09 01:38:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2018-12-09 01:38:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-09 01:38:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2018-12-09 01:38:04,049 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 31 [2018-12-09 01:38:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:38:04,049 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2018-12-09 01:38:04,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 01:38:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2018-12-09 01:38:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 01:38:04,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:38:04,050 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-12-09 01:38:04,050 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:38:04,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:38:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2004369190, now seen corresponding path program 1 times [2018-12-09 01:38:04,050 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:38:04,050 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:38:04,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:38:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:38:04,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:38:04,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 01:38:04,157 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-12-09 01:38:04,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:38:04,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:38:04,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:04,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2018-12-09 01:38:04,202 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-12-09 01:38:04,204 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-12-09 01:38:04,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:38:04,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:04,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:04,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2018-12-09 01:38:04,525 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-12-09 01:38:04,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12-09 01:38:04,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:38:04,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:38:04,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:38:04,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:38 [2018-12-09 01:38:04,763 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-12-09 01:38:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:38:04,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:38:06,700 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-12-09 01:38:06,812 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-12-09 01:38:06,816 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-12-09 01:38:06,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:38:06,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:06,863 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-12-09 01:38:06,969 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2018-12-09 01:38:06,973 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-12-09 01:38:06,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:38:07,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:07,022 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-12-09 01:38:07,149 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-12-09 01:38:07,154 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-12-09 01:38:07,155 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:38:07,210 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:07,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:38:07,357 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:173, output treesize:121 [2018-12-09 01:38:07,733 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 01:38:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:38:07,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:38:07,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-12-09 01:38:07,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 01:38:07,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 01:38:07,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2018-12-09 01:38:07,746 INFO L87 Difference]: Start difference. First operand 195 states and 218 transitions. Second operand 29 states. [2018-12-09 01:38:08,586 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-09 01:38:08,879 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 01:38:09,270 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-12-09 01:38:10,505 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-12-09 01:38:11,645 WARN L180 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2018-12-09 01:38:11,895 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-09 01:38:12,836 WARN L180 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-12-09 01:38:13,214 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-09 01:38:14,585 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-12-09 01:38:15,779 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-09 01:38:16,071 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-09 01:38:16,413 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-12-09 01:38:16,682 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-09 01:38:17,883 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-12-09 01:38:18,297 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-12-09 01:38:18,861 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-12-09 01:38:19,231 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-12-09 01:38:19,978 WARN L180 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-12-09 01:38:20,872 WARN L180 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2018-12-09 01:38:21,532 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2018-12-09 01:38:21,955 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-09 01:38:22,543 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-12-09 01:38:23,201 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2018-12-09 01:38:23,826 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-12-09 01:38:24,376 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2018-12-09 01:38:24,759 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 01:38:25,555 WARN L180 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-09 01:38:26,425 WARN L180 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2018-12-09 01:38:27,086 WARN L180 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-12-09 01:38:27,556 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-12-09 01:38:28,033 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-12-09 01:38:28,663 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 01:38:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:38:29,005 INFO L93 Difference]: Finished difference Result 385 states and 428 transitions. [2018-12-09 01:38:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-09 01:38:29,008 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2018-12-09 01:38:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:38:29,010 INFO L225 Difference]: With dead ends: 385 [2018-12-09 01:38:29,010 INFO L226 Difference]: Without dead ends: 385 [2018-12-09 01:38:29,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=697, Invalid=3209, Unknown=0, NotChecked=0, Total=3906 [2018-12-09 01:38:29,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-12-09 01:38:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 310. [2018-12-09 01:38:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-09 01:38:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 353 transitions. [2018-12-09 01:38:29,023 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 353 transitions. Word has length 33 [2018-12-09 01:38:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:38:29,023 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 353 transitions. [2018-12-09 01:38:29,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 01:38:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 353 transitions. [2018-12-09 01:38:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 01:38:29,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:38:29,025 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-12-09 01:38:29,025 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:38:29,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:38:29,025 INFO L82 PathProgramCache]: Analyzing trace with hash -847293160, now seen corresponding path program 3 times [2018-12-09 01:38:29,025 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:38:29,026 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:38:29,049 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 01:38:29,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-09 01:38:29,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:38:29,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:38:29,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:38:29,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:38:29,379 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-12-09 01:38:29,384 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-12-09 01:38:29,385 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:38:29,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:29,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:29,411 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-12-09 01:38:29,445 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-12-09 01:38:29,447 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-12-09 01:38:29,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:38:29,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:29,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:29,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-12-09 01:38:29,517 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-12-09 01:38:29,521 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-12-09 01:38:29,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:38:29,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:29,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:38:29,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:46 [2018-12-09 01:38:29,989 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-12-09 01:38:29,993 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-12-09 01:38:29,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:38:30,016 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-12-09 01:38:30,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:38:30,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:38:30,063 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-12-09 01:38:30,063 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:70 [2018-12-09 01:38:30,428 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-09 01:38:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-09 01:38:30,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:39:17,019 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 01:39:17,033 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-12-09 01:39:17,044 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-12-09 01:39:17,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:17,142 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-12-09 01:39:17,246 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-12-09 01:39:17,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:19,317 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-12-09 01:39:19,320 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:39:19,322 INFO L303 Elim1Store]: Index analysis took 2016 ms [2018-12-09 01:39:19,322 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-12-09 01:39:19,323 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:19,381 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-12-09 01:39:19,382 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:19,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:39:19,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:39:19,767 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-12-09 01:39:19,782 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-12-09 01:39:19,782 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:19,868 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-12-09 01:39:19,971 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:39:19,971 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:39:19,973 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-12-09 01:39:19,974 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:20,042 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-12-09 01:39:20,042 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:20,095 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-12-09 01:39:20,096 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:20,137 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:39:20,209 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:39:20,476 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-12-09 01:39:20,476 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:143, output treesize:183 [2018-12-09 01:39:21,585 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-12-09 01:39:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-09 01:39:21,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:39:21,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 27 [2018-12-09 01:39:21,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 01:39:21,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 01:39:21,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=671, Unknown=9, NotChecked=0, Total=756 [2018-12-09 01:39:21,732 INFO L87 Difference]: Start difference. First operand 310 states and 353 transitions. Second operand 28 states. [2018-12-09 01:39:27,029 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-09 01:39:36,054 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2018-12-09 01:39:37,360 WARN L180 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 01:39:41,731 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2018-12-09 01:39:50,487 WARN L180 SmtUtils]: Spent 8.38 s on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2018-12-09 01:39:59,602 WARN L180 SmtUtils]: Spent 8.37 s on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2018-12-09 01:40:13,110 WARN L180 SmtUtils]: Spent 12.68 s on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2018-12-09 01:40:13,492 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-12-09 01:40:27,390 WARN L180 SmtUtils]: Spent 13.08 s on a formula simplification. DAG size of input: 148 DAG size of output: 100 [2018-12-09 01:40:28,495 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-09 01:40:42,946 WARN L180 SmtUtils]: Spent 13.73 s on a formula simplification. DAG size of input: 171 DAG size of output: 109 [2018-12-09 01:40:44,919 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2018-12-09 01:40:59,645 WARN L180 SmtUtils]: Spent 14.04 s on a formula simplification. DAG size of input: 175 DAG size of output: 116 [2018-12-09 01:41:02,224 WARN L180 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 108 [2018-12-09 01:41:17,084 WARN L180 SmtUtils]: Spent 13.58 s on a formula simplification. DAG size of input: 146 DAG size of output: 103 [2018-12-09 01:41:17,925 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-12-09 01:41:32,016 WARN L180 SmtUtils]: Spent 13.18 s on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2018-12-09 01:41:32,868 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-12-09 01:41:47,057 WARN L180 SmtUtils]: Spent 13.34 s on a formula simplification. DAG size of input: 156 DAG size of output: 100 [2018-12-09 01:41:48,625 WARN L180 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-12-09 01:42:03,464 WARN L180 SmtUtils]: Spent 13.90 s on a formula simplification. DAG size of input: 179 DAG size of output: 108 [2018-12-09 01:42:19,232 WARN L180 SmtUtils]: Spent 14.71 s on a formula simplification. DAG size of input: 183 DAG size of output: 111 [2018-12-09 01:42:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:42:20,088 INFO L93 Difference]: Finished difference Result 309 states and 347 transitions. [2018-12-09 01:42:20,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 01:42:20,091 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2018-12-09 01:42:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:42:20,092 INFO L225 Difference]: With dead ends: 309 [2018-12-09 01:42:20,092 INFO L226 Difference]: Without dead ends: 263 [2018-12-09 01:42:20,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 219.1s TimeCoverageRelationStatistics Valid=391, Invalid=2249, Unknown=12, NotChecked=0, Total=2652 [2018-12-09 01:42:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-09 01:42:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 103. [2018-12-09 01:42:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 01:42:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2018-12-09 01:42:20,096 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 53 [2018-12-09 01:42:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:42:20,096 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2018-12-09 01:42:20,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 01:42:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2018-12-09 01:42:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 01:42:20,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:20,097 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-12-09 01:42:20,097 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 01:42:20,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:20,098 INFO L82 PathProgramCache]: Analyzing trace with hash -196194070, now seen corresponding path program 3 times [2018-12-09 01:42:20,098 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:42:20,098 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1536a0ce-e238-4be7-8ff8-e119d2efc7e7/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-12-09 01:42:20,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 01:42:20,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 01:42:20,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:42:20,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:42:20,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 01:42:20,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:20,395 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-12-09 01:42:20,399 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-12-09 01:42:20,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:20,406 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:20,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:20,423 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-12-09 01:42:20,452 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-12-09 01:42:20,455 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-12-09 01:42:20,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:20,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:20,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:20,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2018-12-09 01:42:20,525 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-12-09 01:42:20,529 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-12-09 01:42:20,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:20,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:20,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:42:20,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-12-09 01:42:20,869 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-12-09 01:42:20,884 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-12-09 01:42:20,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:42:20,909 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-12-09 01:42:20,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:20,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:42:20,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:42:20,973 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:80, output treesize:80 [2018-12-09 01:42:21,305 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-12-09 01:42:21,744 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2018-12-09 01:42:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-09 01:42:21,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:42:25,756 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 01:42:57,407 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-12-09 01:42:57,652 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-12-09 01:42:57,664 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-12-09 01:42:57,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:42:57,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 25 treesize of output 21 [2018-12-09 01:42:59,766 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-12-09 01:42:59,770 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:42:59,772 INFO L303 Elim1Store]: Index analysis took 2016 ms [2018-12-09 01:42:59,772 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-12-09 01:42:59,772 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:42:59,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:42:59,885 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-12-09 01:43:00,229 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-12-09 01:43:00,418 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-12-09 01:43:00,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 13 treesize of output 12 [2018-12-09 01:43:00,429 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:00,518 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-12-09 01:43:00,534 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:43:00,535 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:43:00,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-09 01:43:00,536 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:43:00,564 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:43:00,644 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-12-09 01:43:01,007 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-12-09 01:43:01,007 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:205, output treesize:181 [2018-12-09 01:43:02,144 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-12-09 01:43:02,309 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 1 [2018-12-09 01:43:02,309 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:02,309 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 20 variables, input treesize:221, output treesize:1 [2018-12-09 01:43:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-09 01:43:02,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:43:02,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2018-12-09 01:43:02,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 01:43:02,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 01:43:02,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=620, Unknown=8, NotChecked=0, Total=702 [2018-12-09 01:43:02,334 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand 27 states. [2018-12-09 01:43:03,259 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-09 01:43:07,602 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2018-12-09 01:43:08,777 WARN L180 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-09 01:43:13,234 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2018-12-09 01:43:14,159 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-09 01:43:18,515 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2018-12-09 01:43:27,082 WARN L180 SmtUtils]: Spent 8.25 s on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2018-12-09 01:43:52,220 WARN L180 SmtUtils]: Spent 24.47 s on a formula simplification. DAG size of input: 141 DAG size of output: 95 [2018-12-09 01:43:53,226 WARN L180 SmtUtils]: Spent 647.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-09 01:44:14,634 WARN L180 SmtUtils]: Spent 20.82 s on a formula simplification. DAG size of input: 154 DAG size of output: 101 [2018-12-09 01:44:16,618 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2018-12-09 01:44:25,762 WARN L180 SmtUtils]: Spent 8.56 s on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2018-12-09 01:44:26,299 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-12-09 01:44:35,580 WARN L180 SmtUtils]: Spent 8.54 s on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2018-12-09 01:44:45,233 WARN L180 SmtUtils]: Spent 8.67 s on a formula simplification. DAG size of input: 136 DAG size of output: 92 [2018-12-09 01:44:45,848 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-12-09 01:44:54,993 WARN L180 SmtUtils]: Spent 8.40 s on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2018-12-09 01:44:55,569 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-12-09 01:45:17,082 WARN L180 SmtUtils]: Spent 20.70 s on a formula simplification. DAG size of input: 152 DAG size of output: 94 [2018-12-09 01:45:18,536 WARN L180 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2018-12-09 01:45:40,145 WARN L180 SmtUtils]: Spent 20.92 s on a formula simplification. DAG size of input: 165 DAG size of output: 101 [2018-12-09 01:45:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:40,671 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-12-09 01:45:40,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 01:45:40,672 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2018-12-09 01:45:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:40,672 INFO L225 Difference]: With dead ends: 117 [2018-12-09 01:45:40,672 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 01:45:40,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 192.5s TimeCoverageRelationStatistics Valid=319, Invalid=2025, Unknown=8, NotChecked=0, Total=2352 [2018-12-09 01:45:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 01:45:40,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 01:45:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 01:45:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 01:45:40,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-12-09 01:45:40,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:40,673 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:45:40,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 01:45:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:45:40,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 01:45:40,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:45:40 BoogieIcfgContainer [2018-12-09 01:45:40,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:45:40,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:45:40,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:45:40,677 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:45:40,677 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:36:07" (3/4) ... [2018-12-09 01:45:40,679 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 01:45:40,683 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 01:45:40,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2018-12-09 01:45:40,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 01:45:40,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 01:45:40,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 01:45:40,686 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-09 01:45:40,687 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 01:45:40,687 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 01:45:40,705 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-12-09 01:45:40,707 INFO L168 Benchmark]: Toolchain (without parser) took 573311.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -66.6 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:45:40,707 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:45:40,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:45:40,707 INFO L168 Benchmark]: Boogie Preprocessor took 31.89 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:45:40,708 INFO L168 Benchmark]: RCFGBuilder took 265.34 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: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:45:40,708 INFO L168 Benchmark]: TraceAbstraction took 572707.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.2 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:45:40,708 INFO L168 Benchmark]: Witness Printer took 29.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 129.0 kB). Peak memory consumption was 129.0 kB. Max. memory is 11.5 GB. [2018-12-09 01:45:40,709 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.89 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 265.34 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: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 572707.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.2 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. * Witness Printer took 29.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 129.0 kB). Peak memory consumption was 129.0 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: 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: 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 - PositiveResult [Line: 565]: 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, 572.6s OverallTime, 22 OverallIterations, 8 TraceHistogramMax, 442.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 498 SDtfs, 1144 SDslu, 2702 SDs, 0 SdLazy, 3610 SolverSat, 345 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 50.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 913 GetRequests, 431 SyntacticMatches, 28 SemanticMatches, 454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3569 ImplicationChecksByTransitivity, 496.6s 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, 363 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 128.6s 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...