./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/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 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/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 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:27:17,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:27:17,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:27:17,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:27:17,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:27:17,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:27:17,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:27:17,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:27:17,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:27:17,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:27:17,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:27:17,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:27:17,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:27:17,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:27:17,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:27:17,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:27:17,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:27:17,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:27:17,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:27:17,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:27:17,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:27:17,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:27:17,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:27:17,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:27:17,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:27:17,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:27:17,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:27:17,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:27:17,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:27:17,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:27:17,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:27:17,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:27:17,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:27:17,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:27:17,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:27:17,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:27:17,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:27:17,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:27:17,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:27:17,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:27:17,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:27:17,783 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-11-30 01:27:17,823 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:27:17,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:27:17,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:27:17,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:27:17,826 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:27:17,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:27:17,827 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:27:17,827 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:27:17,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:27:17,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:27:17,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:27:17,829 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 01:27:17,829 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 01:27:17,829 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 01:27:17,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:27:17,830 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:27:17,830 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:27:17,830 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:27:17,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:27:17,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:27:17,831 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:27:17,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:27:17,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:27:17,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:27:17,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:27:17,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:27:17,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:27:17,833 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:27:17,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/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 -> 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 [2020-11-30 01:27:18,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:27:18,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:27:18,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:27:18,151 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:27:18,154 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:27:18,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-11-30 01:27:18,217 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/data/ca724b721/b0cf09987af7454fac894234c6b3a323/FLAG7b9ae0dbd [2020-11-30 01:27:18,842 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:27:18,842 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-11-30 01:27:18,862 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/data/ca724b721/b0cf09987af7454fac894234c6b3a323/FLAG7b9ae0dbd [2020-11-30 01:27:19,081 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/data/ca724b721/b0cf09987af7454fac894234c6b3a323 [2020-11-30 01:27:19,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:27:19,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 01:27:19,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:27:19,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:27:19,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:27:19,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:27:19" (1/1) ... [2020-11-30 01:27:19,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b54682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:19, skipping insertion in model container [2020-11-30 01:27:19,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:27:19" (1/1) ... [2020-11-30 01:27:19,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:27:19,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:27:19,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:27:19,503 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:27:19,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:27:19,644 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:27:19,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:19 WrapperNode [2020-11-30 01:27:19,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:27:19,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:27:19,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:27:19,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:27:19,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:19" (1/1) ... [2020-11-30 01:27:19,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:19" (1/1) ... [2020-11-30 01:27:19,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:19" (1/1) ... [2020-11-30 01:27:19,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:19" (1/1) ... [2020-11-30 01:27:19,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:19" (1/1) ... [2020-11-30 01:27:19,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:19" (1/1) ... [2020-11-30 01:27:19,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:19" (1/1) ... [2020-11-30 01:27:19,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:27:19,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:27:19,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:27:19,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:27:19,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/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 [2020-11-30 01:27:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-30 01:27:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:27:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-30 01:27:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-30 01:27:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-30 01:27:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-11-30 01:27:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-11-30 01:27:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-11-30 01:27:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2020-11-30 01:27:19,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-30 01:27:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-30 01:27:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-30 01:27:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-30 01:27:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-30 01:27:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-30 01:27:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:27:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-30 01:27:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-30 01:27:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-30 01:27:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-30 01:27:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-30 01:27:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-30 01:27:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-30 01:27:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-30 01:27:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-30 01:27:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-30 01:27:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-30 01:27:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-30 01:27:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-30 01:27:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-30 01:27:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-30 01:27:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-30 01:27:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-30 01:27:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-30 01:27:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-11-30 01:27:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-11-30 01:27:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-11-30 01:27:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-30 01:27:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-30 01:27:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-30 01:27:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-30 01:27:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-30 01:27:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-30 01:27:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-30 01:27:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-30 01:27:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-30 01:27:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-30 01:27:19,821 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-30 01:27:19,821 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-30 01:27:19,821 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-30 01:27:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-30 01:27:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-30 01:27:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-30 01:27:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-30 01:27:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-30 01:27:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-30 01:27:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-30 01:27:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-30 01:27:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-30 01:27:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-30 01:27:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-30 01:27:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-30 01:27:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-30 01:27:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-30 01:27:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-30 01:27:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-30 01:27:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-30 01:27:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-30 01:27:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-30 01:27:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-30 01:27:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-30 01:27:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-30 01:27:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-30 01:27:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-30 01:27:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-30 01:27:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-30 01:27:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-30 01:27:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-30 01:27:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-30 01:27:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-30 01:27:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-30 01:27:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-30 01:27:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-30 01:27:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-30 01:27:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-30 01:27:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-30 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-30 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-30 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-30 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-30 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-30 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-30 01:27:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-30 01:27:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-30 01:27:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-30 01:27:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-30 01:27:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-30 01:27:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-30 01:27:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-30 01:27:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-30 01:27:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-30 01:27:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-30 01:27:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-30 01:27:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-30 01:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-30 01:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-30 01:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-30 01:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-30 01:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-30 01:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-30 01:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-30 01:27:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-30 01:27:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-30 01:27:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-30 01:27:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-30 01:27:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-30 01:27:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-30 01:27:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-30 01:27:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-30 01:27:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-30 01:27:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-30 01:27:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-30 01:27:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-30 01:27:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure append [2020-11-30 01:27:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 01:27:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 01:27:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:27:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-30 01:27:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-30 01:27:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:27:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-30 01:27:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:27:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:27:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:27:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 01:27:20,809 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:27:20,809 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-30 01:27:20,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:27:20 BoogieIcfgContainer [2020-11-30 01:27:20,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:27:20,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:27:20,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:27:20,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:27:20,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:27:19" (1/3) ... [2020-11-30 01:27:20,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5b3a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:27:20, skipping insertion in model container [2020-11-30 01:27:20,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:19" (2/3) ... [2020-11-30 01:27:20,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5b3a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:27:20, skipping insertion in model container [2020-11-30 01:27:20,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:27:20" (3/3) ... [2020-11-30 01:27:20,829 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2020-11-30 01:27:20,844 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:27:20,849 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2020-11-30 01:27:20,861 INFO L253 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2020-11-30 01:27:20,892 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:27:20,892 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 01:27:20,892 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:27:20,892 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:27:20,892 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:27:20,892 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:27:20,892 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:27:20,892 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:27:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2020-11-30 01:27:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 01:27:20,924 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:20,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:20,925 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:20,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:20,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1863992736, now seen corresponding path program 1 times [2020-11-30 01:27:20,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:20,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295627848] [2020-11-30 01:27:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:21,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:21,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295627848] [2020-11-30 01:27:21,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:21,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:27:21,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960164961] [2020-11-30 01:27:21,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:27:21,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:21,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:27:21,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:27:21,227 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 6 states. [2020-11-30 01:27:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:21,698 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2020-11-30 01:27:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:27:21,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-11-30 01:27:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:21,715 INFO L225 Difference]: With dead ends: 95 [2020-11-30 01:27:21,716 INFO L226 Difference]: Without dead ends: 92 [2020-11-30 01:27:21,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:27:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-30 01:27:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2020-11-30 01:27:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-30 01:27:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2020-11-30 01:27:21,769 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 9 [2020-11-30 01:27:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:21,770 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2020-11-30 01:27:21,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:27:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2020-11-30 01:27:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 01:27:21,770 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:21,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:21,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:27:21,771 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1863992737, now seen corresponding path program 1 times [2020-11-30 01:27:21,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:21,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337746894] [2020-11-30 01:27:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:21,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:21,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337746894] [2020-11-30 01:27:21,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:21,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:27:21,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169469879] [2020-11-30 01:27:21,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:27:21,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:21,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:27:21,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:27:21,947 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 6 states. [2020-11-30 01:27:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:22,399 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2020-11-30 01:27:22,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:27:22,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-11-30 01:27:22,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:22,403 INFO L225 Difference]: With dead ends: 121 [2020-11-30 01:27:22,403 INFO L226 Difference]: Without dead ends: 121 [2020-11-30 01:27:22,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:27:22,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-30 01:27:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2020-11-30 01:27:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 01:27:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2020-11-30 01:27:22,431 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 9 [2020-11-30 01:27:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:22,432 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2020-11-30 01:27:22,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:27:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2020-11-30 01:27:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:27:22,433 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:22,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:22,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:27:22,436 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1949200060, now seen corresponding path program 1 times [2020-11-30 01:27:22,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:22,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114524422] [2020-11-30 01:27:22,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:22,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:22,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114524422] [2020-11-30 01:27:22,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:22,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:27:22,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615857303] [2020-11-30 01:27:22,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:27:22,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:22,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:27:22,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:27:22,564 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 4 states. [2020-11-30 01:27:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:22,809 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-11-30 01:27:22,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:27:22,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-30 01:27:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:22,811 INFO L225 Difference]: With dead ends: 96 [2020-11-30 01:27:22,811 INFO L226 Difference]: Without dead ends: 96 [2020-11-30 01:27:22,811 INFO L677 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 [2020-11-30 01:27:22,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-30 01:27:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-11-30 01:27:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-30 01:27:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2020-11-30 01:27:22,818 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 10 [2020-11-30 01:27:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:22,819 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2020-11-30 01:27:22,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:27:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-11-30 01:27:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:27:22,819 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:22,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:22,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:27:22,820 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:22,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:22,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1949200061, now seen corresponding path program 1 times [2020-11-30 01:27:22,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:22,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613276342] [2020-11-30 01:27:22,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:22,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:22,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613276342] [2020-11-30 01:27:22,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:22,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:27:22,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61719496] [2020-11-30 01:27:22,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:27:22,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:22,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:27:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:27:22,949 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 4 states. [2020-11-30 01:27:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:23,143 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-11-30 01:27:23,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:27:23,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-30 01:27:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:23,145 INFO L225 Difference]: With dead ends: 92 [2020-11-30 01:27:23,145 INFO L226 Difference]: Without dead ends: 92 [2020-11-30 01:27:23,145 INFO L677 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 [2020-11-30 01:27:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-30 01:27:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-30 01:27:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-30 01:27:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2020-11-30 01:27:23,152 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 10 [2020-11-30 01:27:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:23,152 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2020-11-30 01:27:23,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:27:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-11-30 01:27:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 01:27:23,153 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:23,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:23,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:27:23,153 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:23,154 INFO L82 PathProgramCache]: Analyzing trace with hash -203601109, now seen corresponding path program 1 times [2020-11-30 01:27:23,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:23,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229502088] [2020-11-30 01:27:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:23,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:23,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229502088] [2020-11-30 01:27:23,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:23,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 01:27:23,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572048108] [2020-11-30 01:27:23,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:27:23,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:27:23,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:27:23,336 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 9 states. [2020-11-30 01:27:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:23,806 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-11-30 01:27:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:27:23,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-11-30 01:27:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:23,808 INFO L225 Difference]: With dead ends: 103 [2020-11-30 01:27:23,809 INFO L226 Difference]: Without dead ends: 103 [2020-11-30 01:27:23,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-11-30 01:27:23,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-30 01:27:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2020-11-30 01:27:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-30 01:27:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2020-11-30 01:27:23,816 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 15 [2020-11-30 01:27:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:23,816 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2020-11-30 01:27:23,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:27:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2020-11-30 01:27:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 01:27:23,816 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:23,817 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:23,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:27:23,817 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2016388927, now seen corresponding path program 1 times [2020-11-30 01:27:23,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:23,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816230462] [2020-11-30 01:27:23,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:24,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:24,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816230462] [2020-11-30 01:27:24,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:24,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:27:24,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227682330] [2020-11-30 01:27:24,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:27:24,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:24,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:27:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:27:24,015 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 8 states. [2020-11-30 01:27:24,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:24,241 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2020-11-30 01:27:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:27:24,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-30 01:27:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:24,242 INFO L225 Difference]: With dead ends: 98 [2020-11-30 01:27:24,242 INFO L226 Difference]: Without dead ends: 98 [2020-11-30 01:27:24,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:27:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-30 01:27:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2020-11-30 01:27:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-30 01:27:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2020-11-30 01:27:24,250 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 16 [2020-11-30 01:27:24,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:24,250 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2020-11-30 01:27:24,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:27:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2020-11-30 01:27:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:27:24,251 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:24,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:24,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:27:24,252 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:24,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash 198096205, now seen corresponding path program 1 times [2020-11-30 01:27:24,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:24,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183899878] [2020-11-30 01:27:24,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:24,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:24,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 01:27:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:24,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183899878] [2020-11-30 01:27:24,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:24,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 01:27:24,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085308333] [2020-11-30 01:27:24,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:27:24,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:24,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:27:24,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:27:24,486 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 9 states. [2020-11-30 01:27:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:24,882 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2020-11-30 01:27:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:27:24,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-11-30 01:27:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:24,884 INFO L225 Difference]: With dead ends: 111 [2020-11-30 01:27:24,884 INFO L226 Difference]: Without dead ends: 111 [2020-11-30 01:27:24,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:27:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-30 01:27:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2020-11-30 01:27:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-30 01:27:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2020-11-30 01:27:24,893 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 25 [2020-11-30 01:27:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:24,894 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2020-11-30 01:27:24,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:27:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2020-11-30 01:27:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:27:24,895 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:24,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:24,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:27:24,896 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash 198096206, now seen corresponding path program 1 times [2020-11-30 01:27:24,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:24,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580610915] [2020-11-30 01:27:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:24,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:25,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 01:27:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:25,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580610915] [2020-11-30 01:27:25,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:25,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 01:27:25,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871950448] [2020-11-30 01:27:25,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:27:25,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:25,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:27:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:27:25,142 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 9 states. [2020-11-30 01:27:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:25,562 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2020-11-30 01:27:25,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:27:25,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-11-30 01:27:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:25,564 INFO L225 Difference]: With dead ends: 106 [2020-11-30 01:27:25,564 INFO L226 Difference]: Without dead ends: 106 [2020-11-30 01:27:25,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:27:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-30 01:27:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2020-11-30 01:27:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-30 01:27:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2020-11-30 01:27:25,570 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 25 [2020-11-30 01:27:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:25,570 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2020-11-30 01:27:25,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:27:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2020-11-30 01:27:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:27:25,572 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:25,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:25,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:27:25,572 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:25,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:25,573 INFO L82 PathProgramCache]: Analyzing trace with hash 198082271, now seen corresponding path program 1 times [2020-11-30 01:27:25,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:25,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915981524] [2020-11-30 01:27:25,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:25,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:25,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 01:27:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:25,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915981524] [2020-11-30 01:27:25,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:25,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:27:25,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038233786] [2020-11-30 01:27:25,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:27:25,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:25,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:27:25,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:27:25,670 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 5 states. [2020-11-30 01:27:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:25,881 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-11-30 01:27:25,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:27:25,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-11-30 01:27:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:25,883 INFO L225 Difference]: With dead ends: 76 [2020-11-30 01:27:25,883 INFO L226 Difference]: Without dead ends: 76 [2020-11-30 01:27:25,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:27:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-30 01:27:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-11-30 01:27:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-30 01:27:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2020-11-30 01:27:25,887 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 25 [2020-11-30 01:27:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:25,887 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2020-11-30 01:27:25,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:27:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-11-30 01:27:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:27:25,888 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:25,888 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:25,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:27:25,889 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:25,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:25,890 INFO L82 PathProgramCache]: Analyzing trace with hash 199318401, now seen corresponding path program 1 times [2020-11-30 01:27:25,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:25,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807919988] [2020-11-30 01:27:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:25,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:25,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 01:27:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:26,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807919988] [2020-11-30 01:27:26,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:26,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:27:26,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744691415] [2020-11-30 01:27:26,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:27:26,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:26,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:27:26,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:27:26,016 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 6 states. [2020-11-30 01:27:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:26,254 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2020-11-30 01:27:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:27:26,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-30 01:27:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:26,256 INFO L225 Difference]: With dead ends: 72 [2020-11-30 01:27:26,256 INFO L226 Difference]: Without dead ends: 72 [2020-11-30 01:27:26,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:27:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-30 01:27:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-11-30 01:27:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-30 01:27:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2020-11-30 01:27:26,260 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2020-11-30 01:27:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:26,260 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2020-11-30 01:27:26,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:27:26,260 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2020-11-30 01:27:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:27:26,261 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:26,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:26,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 01:27:26,262 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash 199008275, now seen corresponding path program 1 times [2020-11-30 01:27:26,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:26,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448611765] [2020-11-30 01:27:26,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:26,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:26,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 01:27:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:26,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448611765] [2020-11-30 01:27:26,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:26,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:27:26,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366977648] [2020-11-30 01:27:26,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:27:26,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:26,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:27:26,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:27:26,484 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 8 states. [2020-11-30 01:27:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:26,767 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-11-30 01:27:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:27:26,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-11-30 01:27:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:26,768 INFO L225 Difference]: With dead ends: 70 [2020-11-30 01:27:26,768 INFO L226 Difference]: Without dead ends: 70 [2020-11-30 01:27:26,769 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:27:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-30 01:27:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-30 01:27:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-30 01:27:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-11-30 01:27:26,772 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 28 [2020-11-30 01:27:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:26,772 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-11-30 01:27:26,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:27:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-11-30 01:27:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 01:27:26,774 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:26,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:26,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 01:27:26,774 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:26,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:26,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1874289326, now seen corresponding path program 1 times [2020-11-30 01:27:26,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:26,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267489313] [2020-11-30 01:27:26,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:26,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:26,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 01:27:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:26,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267489313] [2020-11-30 01:27:26,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:26,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:27:26,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096953837] [2020-11-30 01:27:26,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:27:26,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:26,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:27:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:27:26,989 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 8 states. [2020-11-30 01:27:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:27,364 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-11-30 01:27:27,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:27:27,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-11-30 01:27:27,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:27,367 INFO L225 Difference]: With dead ends: 69 [2020-11-30 01:27:27,367 INFO L226 Difference]: Without dead ends: 69 [2020-11-30 01:27:27,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:27:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-30 01:27:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-30 01:27:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 01:27:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-11-30 01:27:27,370 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 29 [2020-11-30 01:27:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:27,370 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-11-30 01:27:27,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:27:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-11-30 01:27:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:27:27,371 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:27,371 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:27,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 01:27:27,372 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:27,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:27,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1280977847, now seen corresponding path program 1 times [2020-11-30 01:27:27,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:27,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599971776] [2020-11-30 01:27:27,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:27,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:27,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 01:27:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:27,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599971776] [2020-11-30 01:27:27,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655027486] [2020-11-30 01:27:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:27,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 41 conjunts are in the unsatisfiable core [2020-11-30 01:27:27,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:28,144 INFO L384 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 [2020-11-30 01:27:28,145 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:28,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:28,159 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:28,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-11-30 01:27:28,207 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:28,207 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-30 01:27:28,209 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:28,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:28,214 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:28,215 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:7 [2020-11-30 01:27:28,227 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:27:28,227 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:28,233 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:28,234 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:28,234 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-11-30 01:27:28,385 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:28,385 INFO L384 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2020-11-30 01:27:28,386 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:28,416 INFO L625 ElimStorePlain]: treesize reduction 26, result has 44.7 percent of original size [2020-11-30 01:27:28,418 INFO L545 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. [2020-11-30 01:27:28,418 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2020-11-30 01:27:28,633 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:27:28,668 INFO L350 Elim1Store]: treesize reduction 48, result has 27.3 percent of original size [2020-11-30 01:27:28,669 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 30 [2020-11-30 01:27:28,670 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:28,704 INFO L625 ElimStorePlain]: treesize reduction 11, result has 76.1 percent of original size [2020-11-30 01:27:28,708 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:28,708 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2020-11-30 01:27:28,838 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:28,839 INFO L384 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 28 treesize of output 24 [2020-11-30 01:27:28,839 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:28,847 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:28,849 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:28,849 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:11 [2020-11-30 01:27:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:28,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:28,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2020-11-30 01:27:28,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86736664] [2020-11-30 01:27:28,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 01:27:28,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:28,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 01:27:28,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:27:28,874 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 19 states. [2020-11-30 01:27:31,113 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2020-11-30 01:27:32,826 WARN L193 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2020-11-30 01:27:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:35,836 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-11-30 01:27:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-30 01:27:35,837 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2020-11-30 01:27:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:35,838 INFO L225 Difference]: With dead ends: 75 [2020-11-30 01:27:35,838 INFO L226 Difference]: Without dead ends: 75 [2020-11-30 01:27:35,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=157, Invalid=712, Unknown=1, NotChecked=0, Total=870 [2020-11-30 01:27:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-30 01:27:35,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2020-11-30 01:27:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-30 01:27:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2020-11-30 01:27:35,842 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 30 [2020-11-30 01:27:35,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:35,842 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2020-11-30 01:27:35,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 01:27:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-11-30 01:27:35,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:27:35,843 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:35,843 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:36,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-11-30 01:27:36,062 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:36,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:36,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1280977846, now seen corresponding path program 1 times [2020-11-30 01:27:36,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:36,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571230221] [2020-11-30 01:27:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:36,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:36,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 01:27:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:36,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571230221] [2020-11-30 01:27:36,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481461491] [2020-11-30 01:27:36,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:36,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 44 conjunts are in the unsatisfiable core [2020-11-30 01:27:36,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:36,629 INFO L384 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 [2020-11-30 01:27:36,629 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:36,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:36,639 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:36,639 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-11-30 01:27:36,773 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:36,774 INFO L384 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-11-30 01:27:36,774 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:36,817 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2020-11-30 01:27:36,818 INFO L545 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. [2020-11-30 01:27:36,818 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2020-11-30 01:27:36,952 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:27:36,952 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:36,976 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:36,983 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:27:36,983 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:37,005 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:37,009 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:37,009 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:38 [2020-11-30 01:27:37,264 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:37,264 INFO L384 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 53 [2020-11-30 01:27:37,265 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:37,300 INFO L625 ElimStorePlain]: treesize reduction 26, result has 59.4 percent of original size [2020-11-30 01:27:37,302 INFO L545 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. [2020-11-30 01:27:37,302 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:38 [2020-11-30 01:27:37,459 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:27:37,478 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 01:27:37,478 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 20 [2020-11-30 01:27:37,479 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:37,512 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:37,522 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:27:37,542 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 01:27:37,542 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 21 [2020-11-30 01:27:37,543 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:37,563 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:37,565 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:37,565 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:57 [2020-11-30 01:27:37,727 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:37,727 INFO L384 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 28 treesize of output 24 [2020-11-30 01:27:37,727 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:37,751 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:37,763 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:37,764 INFO L384 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 33 treesize of output 25 [2020-11-30 01:27:37,764 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:37,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:37,779 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:37,779 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:71, output treesize:17 [2020-11-30 01:27:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:37,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:37,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2020-11-30 01:27:37,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953815362] [2020-11-30 01:27:37,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 01:27:37,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 01:27:37,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:27:37,809 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 22 states. [2020-11-30 01:27:38,952 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-11-30 01:27:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:39,271 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2020-11-30 01:27:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:27:39,272 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2020-11-30 01:27:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:39,273 INFO L225 Difference]: With dead ends: 74 [2020-11-30 01:27:39,273 INFO L226 Difference]: Without dead ends: 74 [2020-11-30 01:27:39,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2020-11-30 01:27:39,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-30 01:27:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2020-11-30 01:27:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-30 01:27:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2020-11-30 01:27:39,277 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 30 [2020-11-30 01:27:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:39,282 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2020-11-30 01:27:39,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 01:27:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2020-11-30 01:27:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:27:39,284 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:39,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:39,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-30 01:27:39,485 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2026572939, now seen corresponding path program 1 times [2020-11-30 01:27:39,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:39,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416433052] [2020-11-30 01:27:39,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:39,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:39,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 01:27:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:39,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416433052] [2020-11-30 01:27:39,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:39,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:27:39,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617522580] [2020-11-30 01:27:39,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:27:39,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:39,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:27:39,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:27:39,608 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 7 states. [2020-11-30 01:27:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:39,866 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2020-11-30 01:27:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:27:39,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-11-30 01:27:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:39,867 INFO L225 Difference]: With dead ends: 71 [2020-11-30 01:27:39,867 INFO L226 Difference]: Without dead ends: 71 [2020-11-30 01:27:39,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:27:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-30 01:27:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-11-30 01:27:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-30 01:27:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2020-11-30 01:27:39,871 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 30 [2020-11-30 01:27:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:39,871 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2020-11-30 01:27:39,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:27:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2020-11-30 01:27:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-30 01:27:39,872 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:39,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:39,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 01:27:39,872 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:39,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:39,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1600748433, now seen corresponding path program 1 times [2020-11-30 01:27:39,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:39,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14940498] [2020-11-30 01:27:39,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:39,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:40,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 01:27:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:40,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14940498] [2020-11-30 01:27:40,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:40,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 01:27:40,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361391836] [2020-11-30 01:27:40,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:27:40,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:40,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:27:40,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:27:40,120 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 9 states. [2020-11-30 01:27:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:40,483 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-11-30 01:27:40,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:27:40,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-11-30 01:27:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:40,485 INFO L225 Difference]: With dead ends: 70 [2020-11-30 01:27:40,485 INFO L226 Difference]: Without dead ends: 70 [2020-11-30 01:27:40,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:27:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-30 01:27:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-30 01:27:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-30 01:27:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-11-30 01:27:40,488 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 31 [2020-11-30 01:27:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:40,489 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-11-30 01:27:40,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:27:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-11-30 01:27:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-30 01:27:40,489 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:40,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:40,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 01:27:40,490 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:40,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1600748434, now seen corresponding path program 1 times [2020-11-30 01:27:40,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:40,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746776751] [2020-11-30 01:27:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:40,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:40,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 01:27:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:40,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746776751] [2020-11-30 01:27:40,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:40,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:27:40,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501292093] [2020-11-30 01:27:40,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:27:40,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:40,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:27:40,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:27:40,624 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 6 states. [2020-11-30 01:27:40,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:40,850 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2020-11-30 01:27:40,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:27:40,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-11-30 01:27:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:40,851 INFO L225 Difference]: With dead ends: 66 [2020-11-30 01:27:40,852 INFO L226 Difference]: Without dead ends: 66 [2020-11-30 01:27:40,852 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:27:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-30 01:27:40,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-11-30 01:27:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-30 01:27:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2020-11-30 01:27:40,858 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 31 [2020-11-30 01:27:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:40,858 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2020-11-30 01:27:40,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:27:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2020-11-30 01:27:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-30 01:27:40,859 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:40,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:40,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 01:27:40,860 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:40,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1346610171, now seen corresponding path program 1 times [2020-11-30 01:27:40,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:40,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283688992] [2020-11-30 01:27:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:27:40,896 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:27:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:27:40,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:27:40,986 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:27:40,986 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:27:40,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 01:27:41,008 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-11-30 01:27:41,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:27:41 BoogieIcfgContainer [2020-11-30 01:27:41,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:27:41,047 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:27:41,047 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:27:41,047 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:27:41,048 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:27:20" (3/4) ... [2020-11-30 01:27:41,051 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 01:27:41,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:27:41,053 INFO L168 Benchmark]: Toolchain (without parser) took 21966.40 ms. Allocated memory was 96.5 MB in the beginning and 211.8 MB in the end (delta: 115.3 MB). Free memory was 67.3 MB in the beginning and 93.6 MB in the end (delta: -26.3 MB). Peak memory consumption was 87.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:41,053 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 96.5 MB. Free memory is still 56.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:27:41,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 559.60 ms. Allocated memory is still 96.5 MB. Free memory was 67.1 MB in the beginning and 59.8 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:41,054 INFO L168 Benchmark]: Boogie Preprocessor took 94.99 ms. Allocated memory is still 96.5 MB. Free memory was 59.8 MB in the beginning and 56.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:41,055 INFO L168 Benchmark]: RCFGBuilder took 1068.89 ms. Allocated memory was 96.5 MB in the beginning and 121.6 MB in the end (delta: 25.2 MB). Free memory was 56.9 MB in the beginning and 90.8 MB in the end (delta: -33.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:41,055 INFO L168 Benchmark]: TraceAbstraction took 20232.25 ms. Allocated memory was 121.6 MB in the beginning and 211.8 MB in the end (delta: 90.2 MB). Free memory was 90.8 MB in the beginning and 93.6 MB in the end (delta: -2.7 MB). Peak memory consumption was 86.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:41,055 INFO L168 Benchmark]: Witness Printer took 4.64 ms. Allocated memory is still 211.8 MB. Free memory is still 93.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:27:41,058 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 96.5 MB. Free memory is still 56.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 559.60 ms. Allocated memory is still 96.5 MB. Free memory was 67.1 MB in the beginning and 59.8 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 94.99 ms. Allocated memory is still 96.5 MB. Free memory was 59.8 MB in the beginning and 56.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1068.89 ms. Allocated memory was 96.5 MB in the beginning and 121.6 MB in the end (delta: 25.2 MB). Free memory was 56.9 MB in the beginning and 90.8 MB in the end (delta: -33.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20232.25 ms. Allocated memory was 121.6 MB in the beginning and 211.8 MB in the end (delta: 90.2 MB). Free memory was 90.8 MB in the beginning and 93.6 MB in the end (delta: -2.7 MB). Peak memory consumption was 86.3 MB. Max. memory is 16.1 GB. * Witness Printer took 4.64 ms. Allocated memory is still 211.8 MB. Free memory is still 93.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 539. Possible FailurePath: [L524] int c = 0; VAL [\old(c)=55, c=0] [L541] struct item *list = ((void *)0); [L542] int length = 0; VAL [\old(c)=0, c=0, length=0, list={3:0}] [L544] CALL append(&list) VAL [\old(c)=0, c=0, plist={3:0}] [L531] c++ [L532] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L533] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L533] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L534] EXPR item->next VAL [\old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L537] *plist = item VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L544] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={3:0}] [L545] length++ VAL [\old(c)=0, c=1, length=1, list={3:0}] [L546] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L547] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={3:0}] [L548] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={3:0}] [L551] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}] [L551] EXPR list->next VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, list->next={0:0}] [L551] struct item *next = list->next; [L552] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, next={0:0}] [L552] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, next={0:0}] [L552] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, next={0:0}] [L552] free(list) [L553] list = next VAL [\old(c)=0, c=1, length=1, list={3:0}, next={0:0}] [L554] length-- VAL [\old(c)=0, c=1, length=0, list={3:0}, next={0:0}] [L556] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={3:0}, next={0:0}] [L562] return 0; [L541] struct item *list = ((void *)0); [L562] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 119 locations, 45 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.0s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 912 SDtfs, 884 SDslu, 2603 SDs, 0 SdLazy, 3830 SolverSat, 188 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 62 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 419 ConstructedInterpolants, 20 QuantifiedInterpolants, 104454 SizeOfPredicates, 36 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 6/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:27:43,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:27:43,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:27:43,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:27:43,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:27:43,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:27:43,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:27:43,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:27:43,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:27:43,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:27:43,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:27:43,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:27:43,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:27:43,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:27:43,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:27:43,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:27:43,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:27:43,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:27:43,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:27:43,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:27:43,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:27:43,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:27:43,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:27:43,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:27:43,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:27:43,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:27:43,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:27:43,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:27:43,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:27:43,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:27:43,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:27:43,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:27:43,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:27:43,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:27:43,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:27:43,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:27:43,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:27:43,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:27:43,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:27:43,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:27:43,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:27:43,890 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-11-30 01:27:43,918 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:27:43,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:27:43,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:27:43,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:27:43,920 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:27:43,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:27:43,921 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:27:43,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:27:43,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:27:43,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:27:43,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:27:43,922 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 01:27:43,923 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 01:27:43,923 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 01:27:43,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:27:43,923 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:27:43,924 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 01:27:43,924 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 01:27:43,924 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:27:43,924 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:27:43,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:27:43,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:27:43,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:27:43,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:27:43,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:27:43,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:27:43,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:27:43,927 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-30 01:27:43,927 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 01:27:43,927 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:27:43,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:27:43,928 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/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 -> 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 [2020-11-30 01:27:44,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:27:44,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:27:44,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:27:44,372 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:27:44,373 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:27:44,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-11-30 01:27:44,469 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/data/4f5b9f6e7/f4c3452f0e864ac892dfd1a1bb68c9eb/FLAG0502e4667 [2020-11-30 01:27:45,210 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:27:45,211 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-11-30 01:27:45,233 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/data/4f5b9f6e7/f4c3452f0e864ac892dfd1a1bb68c9eb/FLAG0502e4667 [2020-11-30 01:27:45,471 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/data/4f5b9f6e7/f4c3452f0e864ac892dfd1a1bb68c9eb [2020-11-30 01:27:45,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:27:45,476 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 01:27:45,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:27:45,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:27:45,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:27:45,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:27:45" (1/1) ... [2020-11-30 01:27:45,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd680ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:45, skipping insertion in model container [2020-11-30 01:27:45,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:27:45" (1/1) ... [2020-11-30 01:27:45,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:27:45,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:27:46,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:27:46,042 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:27:46,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:27:46,202 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:27:46,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:46 WrapperNode [2020-11-30 01:27:46,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:27:46,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:27:46,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:27:46,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:27:46,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:46" (1/1) ... [2020-11-30 01:27:46,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:46" (1/1) ... [2020-11-30 01:27:46,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:46" (1/1) ... [2020-11-30 01:27:46,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:46" (1/1) ... [2020-11-30 01:27:46,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:46" (1/1) ... [2020-11-30 01:27:46,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:46" (1/1) ... [2020-11-30 01:27:46,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:46" (1/1) ... [2020-11-30 01:27:46,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:27:46,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:27:46,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:27:46,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:27:46,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/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 [2020-11-30 01:27:46,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-30 01:27:46,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:27:46,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-11-30 01:27:46,431 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-30 01:27:46,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-30 01:27:46,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-30 01:27:46,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-11-30 01:27:46,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-11-30 01:27:46,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-11-30 01:27:46,432 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2020-11-30 01:27:46,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-30 01:27:46,432 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-30 01:27:46,433 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-30 01:27:46,433 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-30 01:27:46,433 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-30 01:27:46,433 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-30 01:27:46,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:27:46,434 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-30 01:27:46,434 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-30 01:27:46,434 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-30 01:27:46,434 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-30 01:27:46,434 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-30 01:27:46,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-30 01:27:46,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-30 01:27:46,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-30 01:27:46,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-30 01:27:46,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-30 01:27:46,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-30 01:27:46,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-30 01:27:46,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-30 01:27:46,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-30 01:27:46,436 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-30 01:27:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-30 01:27:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-30 01:27:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-30 01:27:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-11-30 01:27:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-11-30 01:27:46,438 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-11-30 01:27:46,438 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-30 01:27:46,438 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-30 01:27:46,438 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-30 01:27:46,438 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-30 01:27:46,439 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-30 01:27:46,439 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-30 01:27:46,439 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-30 01:27:46,439 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-30 01:27:46,439 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-30 01:27:46,439 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-30 01:27:46,440 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-30 01:27:46,440 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-30 01:27:46,440 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-30 01:27:46,440 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-30 01:27:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-30 01:27:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-30 01:27:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-30 01:27:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-30 01:27:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-30 01:27:46,442 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-30 01:27:46,442 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-30 01:27:46,442 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-30 01:27:46,442 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-30 01:27:46,443 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-30 01:27:46,443 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-30 01:27:46,443 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-30 01:27:46,443 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-30 01:27:46,443 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-30 01:27:46,444 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-30 01:27:46,444 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-30 01:27:46,444 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-30 01:27:46,444 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-30 01:27:46,444 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-30 01:27:46,445 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-30 01:27:46,445 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-30 01:27:46,445 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-30 01:27:46,445 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-30 01:27:46,445 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-30 01:27:46,446 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-30 01:27:46,446 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-30 01:27:46,446 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-30 01:27:46,446 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-30 01:27:46,447 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-30 01:27:46,447 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-30 01:27:46,447 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-30 01:27:46,447 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-30 01:27:46,447 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-30 01:27:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-30 01:27:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-30 01:27:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-30 01:27:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-30 01:27:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-30 01:27:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-30 01:27:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-30 01:27:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-30 01:27:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-30 01:27:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-30 01:27:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-30 01:27:46,450 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-30 01:27:46,450 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-30 01:27:46,450 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-30 01:27:46,450 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-30 01:27:46,450 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-30 01:27:46,451 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-30 01:27:46,451 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-30 01:27:46,451 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-30 01:27:46,451 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-30 01:27:46,451 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-30 01:27:46,452 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-30 01:27:46,452 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-30 01:27:46,452 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-30 01:27:46,452 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-30 01:27:46,452 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-30 01:27:46,452 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-30 01:27:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-30 01:27:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-30 01:27:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-30 01:27:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-30 01:27:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-30 01:27:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-30 01:27:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-30 01:27:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-30 01:27:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-30 01:27:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-30 01:27:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-30 01:27:46,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-30 01:27:46,455 INFO L130 BoogieDeclarations]: Found specification of procedure append [2020-11-30 01:27:46,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 01:27:46,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 01:27:46,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:27:46,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-30 01:27:46,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-30 01:27:46,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:27:46,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-30 01:27:46,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 01:27:46,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:27:46,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-11-30 01:27:46,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-11-30 01:27:46,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-11-30 01:27:47,555 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:27:47,555 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-30 01:27:47,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:27:47 BoogieIcfgContainer [2020-11-30 01:27:47,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:27:47,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:27:47,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:27:47,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:27:47,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:27:45" (1/3) ... [2020-11-30 01:27:47,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c096b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:27:47, skipping insertion in model container [2020-11-30 01:27:47,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:46" (2/3) ... [2020-11-30 01:27:47,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c096b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:27:47, skipping insertion in model container [2020-11-30 01:27:47,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:27:47" (3/3) ... [2020-11-30 01:27:47,568 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2020-11-30 01:27:47,579 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:27:47,589 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2020-11-30 01:27:47,607 INFO L253 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2020-11-30 01:27:47,641 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:27:47,641 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 01:27:47,641 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:27:47,641 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:27:47,641 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:27:47,642 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:27:47,642 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:27:47,642 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:27:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-11-30 01:27:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 01:27:47,681 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:47,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:47,683 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash 920803252, now seen corresponding path program 1 times [2020-11-30 01:27:47,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:27:47,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453382133] [2020-11-30 01:27:47,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 01:27:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:47,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:27:47,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:48,052 INFO L384 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 [2020-11-30 01:27:48,053 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:48,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:48,065 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:48,066 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:27:48,141 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:48,141 INFO L384 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2020-11-30 01:27:48,143 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:48,175 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-11-30 01:27:48,176 INFO L545 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. [2020-11-30 01:27:48,177 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-11-30 01:27:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:48,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:27:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:48,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453382133] [2020-11-30 01:27:48,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:48,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 01:27:48,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497832313] [2020-11-30 01:27:48,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:27:48,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:27:48,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:27:48,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:27:48,278 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 5 states. [2020-11-30 01:27:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:48,851 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2020-11-30 01:27:48,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:27:48,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-30 01:27:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:48,871 INFO L225 Difference]: With dead ends: 94 [2020-11-30 01:27:48,872 INFO L226 Difference]: Without dead ends: 91 [2020-11-30 01:27:48,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:27:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-30 01:27:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2020-11-30 01:27:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-30 01:27:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2020-11-30 01:27:48,939 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2020-11-30 01:27:48,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:48,939 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2020-11-30 01:27:48,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:27:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2020-11-30 01:27:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 01:27:48,941 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:48,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:49,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 01:27:49,169 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:27:49,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:49,170 INFO L82 PathProgramCache]: Analyzing trace with hash 920803253, now seen corresponding path program 1 times [2020-11-30 01:27:49,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:27:49,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602464139] [2020-11-30 01:27:49,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 01:27:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:49,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 01:27:49,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:49,488 INFO L384 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 [2020-11-30 01:27:49,489 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:49,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:49,508 INFO L384 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 [2020-11-30 01:27:49,508 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:49,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:49,520 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:49,521 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 01:27:49,619 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:49,620 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 01:27:49,621 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:49,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:49,644 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-11-30 01:27:49,645 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:49,669 INFO L625 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2020-11-30 01:27:49,670 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:49,671 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2020-11-30 01:27:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:49,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:27:49,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:27:51,801 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_append_#t~malloc6.base_3| (_ BitVec 32))) (or (bvule (bvadd |c_append_#in~plist.offset| (_ bv4 32)) (select (store |c_#length| |v_append_#t~malloc6.base_3| (_ bv8 32)) |c_append_#in~plist.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_append_#t~malloc6.base_3|))))) (or (forall ((|v_append_#t~malloc6.base_3| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_append_#t~malloc6.base_3|)))) (bvule |c_append_#in~plist.offset| (bvadd |c_append_#in~plist.offset| (_ bv4 32))))) is different from false [2020-11-30 01:27:52,865 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-11-30 01:27:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:52,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602464139] [2020-11-30 01:27:52,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:52,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 01:27:52,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444445321] [2020-11-30 01:27:52,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:27:52,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:27:52,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:27:52,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2020-11-30 01:27:52,894 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 8 states. [2020-11-30 01:28:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:07,493 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2020-11-30 01:28:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:28:07,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-11-30 01:28:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:07,498 INFO L225 Difference]: With dead ends: 123 [2020-11-30 01:28:07,498 INFO L226 Difference]: Without dead ends: 123 [2020-11-30 01:28:07,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2020-11-30 01:28:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-30 01:28:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 95. [2020-11-30 01:28:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-30 01:28:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2020-11-30 01:28:07,510 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 9 [2020-11-30 01:28:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:07,510 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2020-11-30 01:28:07,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:28:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2020-11-30 01:28:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:28:07,511 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:07,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:07,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 01:28:07,713 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:28:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:07,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1519870147, now seen corresponding path program 1 times [2020-11-30 01:28:07,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:07,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165459925] [2020-11-30 01:28:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:07,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:28:07,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:07,960 INFO L384 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 [2020-11-30 01:28:07,960 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:07,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:07,963 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:07,963 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:28:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:07,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:07,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165459925] [2020-11-30 01:28:07,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:07,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 01:28:07,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343119312] [2020-11-30 01:28:07,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:28:07,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:07,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:28:07,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:28:07,985 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 3 states. [2020-11-30 01:28:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:08,187 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2020-11-30 01:28:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:28:08,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-30 01:28:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:08,189 INFO L225 Difference]: With dead ends: 91 [2020-11-30 01:28:08,189 INFO L226 Difference]: Without dead ends: 91 [2020-11-30 01:28:08,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:28:08,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-30 01:28:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-11-30 01:28:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-30 01:28:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2020-11-30 01:28:08,211 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2020-11-30 01:28:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:08,211 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-11-30 01:28:08,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:28:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2020-11-30 01:28:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:28:08,212 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:08,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:08,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 01:28:08,429 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:28:08,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1519870146, now seen corresponding path program 1 times [2020-11-30 01:28:08,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:08,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508346032] [2020-11-30 01:28:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:08,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:28:08,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:08,613 INFO L384 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 [2020-11-30 01:28:08,613 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:08,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:08,621 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:08,621 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 01:28:08,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:08,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:08,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508346032] [2020-11-30 01:28:08,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:08,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-11-30 01:28:08,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108050060] [2020-11-30 01:28:08,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:28:08,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:08,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:28:08,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:28:08,702 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 4 states. [2020-11-30 01:28:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:08,948 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2020-11-30 01:28:08,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:28:08,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-30 01:28:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:08,950 INFO L225 Difference]: With dead ends: 87 [2020-11-30 01:28:08,950 INFO L226 Difference]: Without dead ends: 87 [2020-11-30 01:28:08,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:28:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-30 01:28:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-11-30 01:28:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-30 01:28:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2020-11-30 01:28:08,957 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 10 [2020-11-30 01:28:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:08,957 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2020-11-30 01:28:08,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:28:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2020-11-30 01:28:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 01:28:08,958 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:08,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:09,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 01:28:09,169 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:28:09,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1020530207, now seen corresponding path program 1 times [2020-11-30 01:28:09,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:09,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062313675] [2020-11-30 01:28:09,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:09,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 01:28:09,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:09,495 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 01:28:09,495 INFO L384 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 1 case distinctions, treesize of input 23 treesize of output 18 [2020-11-30 01:28:09,496 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:09,509 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:09,543 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 01:28:09,544 INFO L384 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 1 case distinctions, treesize of input 23 treesize of output 18 [2020-11-30 01:28:09,544 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:09,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:09,561 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:09,561 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:37 [2020-11-30 01:28:09,638 INFO L384 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 15 treesize of output 7 [2020-11-30 01:28:09,639 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:09,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:09,653 INFO L384 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 15 treesize of output 7 [2020-11-30 01:28:09,653 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:09,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:09,665 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:09,666 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2020-11-30 01:28:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:09,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:09,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062313675] [2020-11-30 01:28:09,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:09,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2020-11-30 01:28:09,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028832609] [2020-11-30 01:28:09,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:28:09,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:09,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:28:09,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:28:09,731 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 9 states. [2020-11-30 01:28:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:10,444 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2020-11-30 01:28:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:28:10,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-11-30 01:28:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:10,448 INFO L225 Difference]: With dead ends: 99 [2020-11-30 01:28:10,448 INFO L226 Difference]: Without dead ends: 99 [2020-11-30 01:28:10,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:28:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-30 01:28:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2020-11-30 01:28:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-30 01:28:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-11-30 01:28:10,471 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 15 [2020-11-30 01:28:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:10,472 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-11-30 01:28:10,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:28:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-11-30 01:28:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 01:28:10,474 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:10,474 INFO L422 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] [2020-11-30 01:28:10,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 01:28:10,691 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:28:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1002042865, now seen corresponding path program 1 times [2020-11-30 01:28:10,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:10,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215527002] [2020-11-30 01:28:10,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:10,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:28:10,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:10,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:10,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215527002] [2020-11-30 01:28:10,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:10,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 01:28:10,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960296897] [2020-11-30 01:28:10,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:28:10,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:10,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:28:10,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:28:10,950 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 6 states. [2020-11-30 01:28:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:11,075 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2020-11-30 01:28:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:28:11,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-11-30 01:28:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:11,079 INFO L225 Difference]: With dead ends: 140 [2020-11-30 01:28:11,079 INFO L226 Difference]: Without dead ends: 140 [2020-11-30 01:28:11,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:28:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-11-30 01:28:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 98. [2020-11-30 01:28:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-30 01:28:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2020-11-30 01:28:11,104 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 24 [2020-11-30 01:28:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:11,105 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2020-11-30 01:28:11,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:28:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2020-11-30 01:28:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 01:28:11,105 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:11,106 INFO L422 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] [2020-11-30 01:28:11,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 01:28:11,307 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:28:11,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:11,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1003265060, now seen corresponding path program 1 times [2020-11-30 01:28:11,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:11,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996797534] [2020-11-30 01:28:11,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:11,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 01:28:11,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:11,583 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:28:11,583 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:11,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:11,607 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:28:11,607 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:11,627 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:11,628 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:11,628 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-11-30 01:28:11,712 INFO L384 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 15 treesize of output 7 [2020-11-30 01:28:11,713 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:11,729 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:11,734 INFO L384 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 9 [2020-11-30 01:28:11,735 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:11,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:11,745 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:11,745 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2020-11-30 01:28:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:11,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:12,253 INFO L384 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 36 treesize of output 28 [2020-11-30 01:28:12,277 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 01:28:12,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:12,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:12,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:12,326 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:12,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:12,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:12,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:12,364 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:12,387 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:12,387 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-11-30 01:28:12,387 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:19 [2020-11-30 01:28:12,473 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-11-30 01:28:12,502 INFO L384 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 8 treesize of output 6 [2020-11-30 01:28:12,503 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:12,515 INFO L384 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 8 treesize of output 6 [2020-11-30 01:28:12,516 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:12,533 INFO L384 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 16 treesize of output 12 [2020-11-30 01:28:12,534 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:12,546 INFO L384 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 8 treesize of output 6 [2020-11-30 01:28:12,547 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:12,620 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:12,622 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2020-11-30 01:28:12,622 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2020-11-30 01:28:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:12,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996797534] [2020-11-30 01:28:12,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:12,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2020-11-30 01:28:12,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683593627] [2020-11-30 01:28:12,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 01:28:12,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:12,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:28:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:28:12,899 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 12 states. [2020-11-30 01:28:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:14,169 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2020-11-30 01:28:14,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:28:14,170 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-11-30 01:28:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:14,172 INFO L225 Difference]: With dead ends: 109 [2020-11-30 01:28:14,172 INFO L226 Difference]: Without dead ends: 109 [2020-11-30 01:28:14,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:28:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-30 01:28:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2020-11-30 01:28:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-30 01:28:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2020-11-30 01:28:14,185 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 24 [2020-11-30 01:28:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:14,185 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2020-11-30 01:28:14,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 01:28:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2020-11-30 01:28:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 01:28:14,186 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:14,187 INFO L422 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] [2020-11-30 01:28:14,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 01:28:14,398 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:28:14,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1003265061, now seen corresponding path program 1 times [2020-11-30 01:28:14,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:14,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099491334] [2020-11-30 01:28:14,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:14,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 01:28:14,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:14,647 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:28:14,647 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:14,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:14,657 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:14,657 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-11-30 01:28:14,699 INFO L384 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 19 treesize of output 11 [2020-11-30 01:28:14,699 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:14,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:14,703 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:14,703 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-11-30 01:28:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:14,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:14,847 INFO L384 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 32 treesize of output 28 [2020-11-30 01:28:14,848 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:14,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:14,884 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:14,885 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-11-30 01:28:14,993 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:28:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:15,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099491334] [2020-11-30 01:28:15,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:15,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-11-30 01:28:15,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936644272] [2020-11-30 01:28:15,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:28:15,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:15,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:28:15,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:28:15,020 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand 8 states. [2020-11-30 01:28:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:15,571 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2020-11-30 01:28:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:28:15,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-30 01:28:15,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:15,572 INFO L225 Difference]: With dead ends: 105 [2020-11-30 01:28:15,572 INFO L226 Difference]: Without dead ends: 105 [2020-11-30 01:28:15,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:28:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-30 01:28:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2020-11-30 01:28:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-30 01:28:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2020-11-30 01:28:15,596 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 24 [2020-11-30 01:28:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:15,596 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2020-11-30 01:28:15,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:28:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2020-11-30 01:28:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 01:28:15,597 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:15,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:15,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 01:28:15,806 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:28:15,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:15,806 INFO L82 PathProgramCache]: Analyzing trace with hash 408031290, now seen corresponding path program 1 times [2020-11-30 01:28:15,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:15,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416420559] [2020-11-30 01:28:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:16,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:28:16,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:16,051 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:28:16,051 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,057 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-30 01:28:16,085 INFO L384 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 15 treesize of output 7 [2020-11-30 01:28:16,086 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,090 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,090 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-30 01:28:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:16,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:16,208 INFO L384 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 28 treesize of output 24 [2020-11-30 01:28:16,212 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 01:28:16,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,220 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-11-30 01:28:16,220 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2020-11-30 01:28:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:16,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416420559] [2020-11-30 01:28:16,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:16,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 01:28:16,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212081838] [2020-11-30 01:28:16,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:28:16,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:16,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:28:16,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:28:16,248 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand 6 states. [2020-11-30 01:28:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:16,553 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2020-11-30 01:28:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:28:16,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-30 01:28:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:16,555 INFO L225 Difference]: With dead ends: 107 [2020-11-30 01:28:16,555 INFO L226 Difference]: Without dead ends: 107 [2020-11-30 01:28:16,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:28:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-30 01:28:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2020-11-30 01:28:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-30 01:28:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2020-11-30 01:28:16,561 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 27 [2020-11-30 01:28:16,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:16,562 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2020-11-30 01:28:16,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:28:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2020-11-30 01:28:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:28:16,563 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:16,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:16,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 01:28:16,764 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:28:16,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:16,764 INFO L82 PathProgramCache]: Analyzing trace with hash -235931780, now seen corresponding path program 1 times [2020-11-30 01:28:16,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:16,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700423911] [2020-11-30 01:28:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:16,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 01:28:16,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:17,032 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 01:28:17,032 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:17,043 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:17,043 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:17,044 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2020-11-30 01:28:17,127 INFO L384 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 11 [2020-11-30 01:28:17,128 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:17,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:17,135 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:17,135 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2020-11-30 01:28:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:17,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:17,417 INFO L384 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 28 treesize of output 24 [2020-11-30 01:28:17,418 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:17,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:17,449 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:17,449 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2020-11-30 01:28:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:17,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700423911] [2020-11-30 01:28:17,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:17,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2020-11-30 01:28:17,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967392273] [2020-11-30 01:28:17,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 01:28:17,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:17,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 01:28:17,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:28:17,527 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 11 states. [2020-11-30 01:28:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:18,379 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2020-11-30 01:28:18,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:28:18,380 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-11-30 01:28:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:18,381 INFO L225 Difference]: With dead ends: 106 [2020-11-30 01:28:18,382 INFO L226 Difference]: Without dead ends: 106 [2020-11-30 01:28:18,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:28:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-30 01:28:18,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2020-11-30 01:28:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-30 01:28:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2020-11-30 01:28:18,388 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 28 [2020-11-30 01:28:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:18,388 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2020-11-30 01:28:18,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 01:28:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2020-11-30 01:28:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 01:28:18,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:18,390 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:18,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 01:28:18,590 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:28:18,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:18,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2021644624, now seen corresponding path program 1 times [2020-11-30 01:28:18,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:18,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635429240] [2020-11-30 01:28:18,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:18,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-30 01:28:18,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:18,985 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:28:18,986 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:18,995 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:18,996 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:18,996 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-11-30 01:28:19,048 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:19,048 INFO L384 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2020-11-30 01:28:19,048 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:19,090 INFO L625 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2020-11-30 01:28:19,091 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:19,091 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-11-30 01:28:19,198 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 01:28:19,199 INFO L384 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 1 case distinctions, treesize of input 27 treesize of output 22 [2020-11-30 01:28:19,199 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:19,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:19,213 INFO L545 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. [2020-11-30 01:28:19,214 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-11-30 01:28:19,266 INFO L384 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 19 treesize of output 11 [2020-11-30 01:28:19,266 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:19,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:19,273 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:19,273 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:13 [2020-11-30 01:28:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:19,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:19,531 INFO L384 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 32 treesize of output 28 [2020-11-30 01:28:19,532 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:19,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:19,572 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:19,572 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-11-30 01:28:19,660 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:28:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:19,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635429240] [2020-11-30 01:28:19,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:28:19,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-11-30 01:28:19,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231824899] [2020-11-30 01:28:19,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:28:19,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:19,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:28:19,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:28:19,675 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand 14 states. [2020-11-30 01:28:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:20,807 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2020-11-30 01:28:20,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:28:20,807 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-11-30 01:28:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:20,808 INFO L225 Difference]: With dead ends: 109 [2020-11-30 01:28:20,808 INFO L226 Difference]: Without dead ends: 109 [2020-11-30 01:28:20,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:28:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-30 01:28:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2020-11-30 01:28:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-30 01:28:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2020-11-30 01:28:20,812 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 29 [2020-11-30 01:28:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:20,812 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2020-11-30 01:28:20,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:28:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2020-11-30 01:28:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 01:28:20,813 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:20,813 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:21,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-30 01:28:21,013 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:28:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2021644625, now seen corresponding path program 1 times [2020-11-30 01:28:21,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:21,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55005182] [2020-11-30 01:28:21,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:21,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjunts are in the unsatisfiable core [2020-11-30 01:28:21,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:21,323 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:28:21,323 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:21,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:21,366 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:28:21,366 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:21,384 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:21,385 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:21,385 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2020-11-30 01:28:21,483 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:21,484 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2020-11-30 01:28:21,484 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:21,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:21,530 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2020-11-30 01:28:21,531 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:21,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:21,550 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:21,550 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2020-11-30 01:28:21,683 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 01:28:21,683 INFO L384 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 1 case distinctions, treesize of input 33 treesize of output 24 [2020-11-30 01:28:21,684 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:21,723 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:21,763 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 01:28:21,763 INFO L384 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 1 case distinctions, treesize of input 23 treesize of output 18 [2020-11-30 01:28:21,764 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:21,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:21,797 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:21,797 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:52 [2020-11-30 01:28:21,905 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:21,906 INFO L384 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 26 treesize of output 22 [2020-11-30 01:28:21,906 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:21,932 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:21,946 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:21,947 INFO L384 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 36 treesize of output 28 [2020-11-30 01:28:21,947 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:21,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:21,961 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:21,961 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:66, output treesize:18 [2020-11-30 01:28:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:22,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:22,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:28:23,429 WARN L193 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-11-30 01:28:27,032 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-30 01:28:33,088 INFO L384 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 66 treesize of output 62 [2020-11-30 01:28:33,089 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:33,194 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-11-30 01:28:33,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:33,205 INFO L384 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 102 treesize of output 94 [2020-11-30 01:28:33,206 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:28:33,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:28:33,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:28:33,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:28:33,209 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:28:33,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:28:33,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:28:33,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:28:33,212 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:33,422 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2020-11-30 01:28:33,423 INFO L625 ElimStorePlain]: treesize reduction 56, result has 59.7 percent of original size [2020-11-30 01:28:33,438 INFO L384 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 32 [2020-11-30 01:28:33,443 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2020-11-30 01:28:33,529 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:33,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:28:33,530 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:28:33,531 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:28:33,533 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-11-30 01:28:33,533 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2020-11-30 01:28:33,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:28:33,534 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:28:33,534 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:28:44,494 WARN L193 SmtUtils]: Spent 6.53 s on a formula simplification that was a NOOP. DAG size: 43 [2020-11-30 01:28:44,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:28:44,496 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:28:44,497 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:29:05,943 WARN L193 SmtUtils]: Spent 14.11 s on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2020-11-30 01:29:05,946 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-11-30 01:29:05,971 INFO L441 ElimStorePlain]: Different costs {5=[|#length|], 10=[|#valid|]} [2020-11-30 01:29:05,978 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:29:05,979 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:05,988 INFO L384 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 8 treesize of output 6 [2020-11-30 01:29:05,989 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:29:06,007 INFO L384 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 8 treesize of output 6 [2020-11-30 01:29:06,008 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:29:06,022 INFO L384 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 8 treesize of output 6 [2020-11-30 01:29:06,022 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:29:06,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:06,104 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:06,105 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 01:29:06,105 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:06,163 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:06,164 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 01:29:06,164 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:06,181 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:06,181 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 01:29:06,181 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:06,235 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:06,241 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2020-11-30 01:29:06,241 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:118, output treesize:35 [2020-11-30 01:29:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:29:10,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55005182] [2020-11-30 01:29:10,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:29:10,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2020-11-30 01:29:10,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753890399] [2020-11-30 01:29:10,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 01:29:10,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:29:10,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 01:29:10,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=292, Unknown=3, NotChecked=0, Total=342 [2020-11-30 01:29:10,482 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 19 states. [2020-11-30 01:29:11,489 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2020-11-30 01:29:11,783 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-11-30 01:29:12,110 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2020-11-30 01:29:14,354 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2020-11-30 01:29:14,928 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-11-30 01:29:23,486 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-30 01:29:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:30,559 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2020-11-30 01:29:30,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 01:29:30,561 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2020-11-30 01:29:30,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:30,562 INFO L225 Difference]: With dead ends: 111 [2020-11-30 01:29:30,562 INFO L226 Difference]: Without dead ends: 111 [2020-11-30 01:29:30,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 51.3s TimeCoverageRelationStatistics Valid=163, Invalid=590, Unknown=3, NotChecked=0, Total=756 [2020-11-30 01:29:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-30 01:29:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2020-11-30 01:29:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-30 01:29:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2020-11-30 01:29:30,567 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 29 [2020-11-30 01:29:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:30,568 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2020-11-30 01:29:30,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 01:29:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2020-11-30 01:29:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 01:29:30,569 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:30,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:30,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-11-30 01:29:30,783 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:29:30,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:30,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1276049532, now seen corresponding path program 1 times [2020-11-30 01:29:30,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:29:30,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578652544] [2020-11-30 01:29:30,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-11-30 01:29:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:30,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 01:29:30,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:31,009 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:29:31,010 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:31,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:31,018 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:29:31,018 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-11-30 01:29:31,057 INFO L384 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 19 treesize of output 11 [2020-11-30 01:29:31,057 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:31,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:31,060 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:29:31,060 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-11-30 01:29:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:29:31,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:29:31,187 INFO L384 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 32 treesize of output 28 [2020-11-30 01:29:31,188 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:29:31,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:31,208 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:29:31,209 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-11-30 01:29:31,312 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:29:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:29:31,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578652544] [2020-11-30 01:29:31,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:31,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-11-30 01:29:31,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767945711] [2020-11-30 01:29:31,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:29:31,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:29:31,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:29:31,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:29:31,330 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 8 states. [2020-11-30 01:29:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:31,830 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2020-11-30 01:29:31,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:29:31,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-11-30 01:29:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:31,831 INFO L225 Difference]: With dead ends: 105 [2020-11-30 01:29:31,832 INFO L226 Difference]: Without dead ends: 105 [2020-11-30 01:29:31,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:29:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-30 01:29:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2020-11-30 01:29:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-30 01:29:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2020-11-30 01:29:31,836 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 29 [2020-11-30 01:29:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:31,836 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2020-11-30 01:29:31,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:29:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2020-11-30 01:29:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:29:31,842 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:31,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:32,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-11-30 01:29:32,050 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:29:32,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:32,050 INFO L82 PathProgramCache]: Analyzing trace with hash 902829951, now seen corresponding path program 1 times [2020-11-30 01:29:32,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:29:32,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412785209] [2020-11-30 01:29:32,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-11-30 01:29:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:32,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 01:29:32,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:32,263 INFO L384 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 [2020-11-30 01:29:32,264 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,265 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:32,265 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,266 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:29:32,305 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-30 01:29:32,306 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,313 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:32,314 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,314 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2020-11-30 01:29:32,347 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:32,347 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2020-11-30 01:29:32,348 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:32,359 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,359 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2020-11-30 01:29:32,379 INFO L384 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 16 treesize of output 8 [2020-11-30 01:29:32,380 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,384 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:32,384 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,384 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2020-11-30 01:29:32,430 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-11-30 01:29:32,430 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,440 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-11-30 01:29:32,440 INFO L545 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. [2020-11-30 01:29:32,440 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2020-11-30 01:29:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:29:32,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:29:32,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:29:32,597 INFO L384 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 6 treesize of output 4 [2020-11-30 01:29:32,598 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:32,601 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,601 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:6 [2020-11-30 01:29:32,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:29:32,663 INFO L384 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 6 treesize of output 4 [2020-11-30 01:29:32,664 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,685 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:32,685 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2020-11-30 01:29:32,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:29:32,691 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:29:32,719 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:32,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:29:32,729 INFO L384 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 [2020-11-30 01:29:32,734 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-11-30 01:29:32,800 INFO L625 ElimStorePlain]: treesize reduction 5, result has 83.9 percent of original size [2020-11-30 01:29:32,800 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-11-30 01:29:32,801 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:50, output treesize:26 [2020-11-30 01:29:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:29:32,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412785209] [2020-11-30 01:29:32,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:32,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2020-11-30 01:29:32,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328890865] [2020-11-30 01:29:32,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 01:29:32,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:29:32,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:29:32,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:29:32,901 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 12 states. [2020-11-30 01:29:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:37,584 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2020-11-30 01:29:37,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:29:37,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-11-30 01:29:37,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:37,585 INFO L225 Difference]: With dead ends: 118 [2020-11-30 01:29:37,585 INFO L226 Difference]: Without dead ends: 118 [2020-11-30 01:29:37,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2020-11-30 01:29:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-11-30 01:29:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2020-11-30 01:29:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-30 01:29:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2020-11-30 01:29:37,590 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 30 [2020-11-30 01:29:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:37,590 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2020-11-30 01:29:37,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 01:29:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2020-11-30 01:29:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:29:37,591 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:37,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:37,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-11-30 01:29:37,792 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:29:37,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:37,792 INFO L82 PathProgramCache]: Analyzing trace with hash 902829952, now seen corresponding path program 1 times [2020-11-30 01:29:37,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:29:37,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629634907] [2020-11-30 01:29:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-11-30 01:29:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:37,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:29:37,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:29:38,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:29:38,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:29:38,057 INFO L384 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 8 treesize of output 6 [2020-11-30 01:29:38,058 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:29:38,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:29:38,075 INFO L545 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. [2020-11-30 01:29:38,075 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2020-11-30 01:29:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:29:38,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629634907] [2020-11-30 01:29:38,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:38,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-30 01:29:38,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217077847] [2020-11-30 01:29:38,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:29:38,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:29:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:29:38,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:29:38,111 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 6 states. [2020-11-30 01:29:38,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:38,206 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2020-11-30 01:29:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:29:38,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-11-30 01:29:38,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:38,207 INFO L225 Difference]: With dead ends: 92 [2020-11-30 01:29:38,208 INFO L226 Difference]: Without dead ends: 92 [2020-11-30 01:29:38,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:29:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-30 01:29:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2020-11-30 01:29:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-30 01:29:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2020-11-30 01:29:38,211 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 30 [2020-11-30 01:29:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:38,212 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2020-11-30 01:29:38,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:29:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-11-30 01:29:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-30 01:29:38,213 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:38,213 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:38,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-11-30 01:29:38,413 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-11-30 01:29:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash 419984937, now seen corresponding path program 1 times [2020-11-30 01:29:38,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:29:38,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425448375] [2020-11-30 01:29:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1107efbb-c398-4825-99e6-cda9f5f7a8d3/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-11-30 01:29:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:29:38,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:29:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:29:38,731 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:29:38,780 INFO L173 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-11-30 01:29:38,780 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:29:38,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-11-30 01:29:38,995 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-11-30 01:29:39,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:29:39 BoogieIcfgContainer [2020-11-30 01:29:39,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:29:39,047 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:29:39,047 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:29:39,047 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:29:39,048 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:27:47" (3/4) ... [2020-11-30 01:29:39,051 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 01:29:39,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:29:39,052 INFO L168 Benchmark]: Toolchain (without parser) took 113575.54 ms. Allocated memory was 75.5 MB in the beginning and 119.5 MB in the end (delta: 44.0 MB). Free memory was 59.2 MB in the beginning and 36.2 MB in the end (delta: 23.0 MB). Peak memory consumption was 68.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:29:39,052 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 75.5 MB. Free memory is still 58.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:29:39,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.59 ms. Allocated memory is still 75.5 MB. Free memory was 59.0 MB in the beginning and 46.3 MB in the end (delta: 12.8 MB). Peak memory consumption was 11.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:29:39,053 INFO L168 Benchmark]: Boogie Preprocessor took 119.82 ms. Allocated memory is still 75.5 MB. Free memory was 46.1 MB in the beginning and 43.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:29:39,053 INFO L168 Benchmark]: RCFGBuilder took 1233.07 ms. Allocated memory was 75.5 MB in the beginning and 94.4 MB in the end (delta: 18.9 MB). Free memory was 43.0 MB in the beginning and 57.0 MB in the end (delta: -14.0 MB). Peak memory consumption was 17.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:29:39,053 INFO L168 Benchmark]: TraceAbstraction took 111485.94 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 56.4 MB in the beginning and 36.2 MB in the end (delta: 20.2 MB). Peak memory consumption was 45.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:29:39,054 INFO L168 Benchmark]: Witness Printer took 3.71 ms. Allocated memory is still 119.5 MB. Free memory is still 36.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:29:39,056 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 75.5 MB. Free memory is still 58.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 726.59 ms. Allocated memory is still 75.5 MB. Free memory was 59.0 MB in the beginning and 46.3 MB in the end (delta: 12.8 MB). Peak memory consumption was 11.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 119.82 ms. Allocated memory is still 75.5 MB. Free memory was 46.1 MB in the beginning and 43.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1233.07 ms. Allocated memory was 75.5 MB in the beginning and 94.4 MB in the end (delta: 18.9 MB). Free memory was 43.0 MB in the beginning and 57.0 MB in the end (delta: -14.0 MB). Peak memory consumption was 17.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 111485.94 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 56.4 MB in the beginning and 36.2 MB in the end (delta: 20.2 MB). Peak memory consumption was 45.4 MB. Max. memory is 16.1 GB. * Witness Printer took 3.71 ms. Allocated memory is still 119.5 MB. Free memory is still 36.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 539. Possible FailurePath: [L524] int c = 0; VAL [\old(c)=12, c=0] [L541] struct item *list = ((void *)0); [L542] int length = 0; VAL [\old(c)=0, c=0, length=0, list={31:0}] [L544] CALL append(&list) VAL [\old(c)=0, c=0, plist={31:0}] [L531] c++ [L532] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={3:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L533] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={3:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L533] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={3:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L534] EXPR item->next VAL [\old(c)=0, c=1, item={3:0}, item->next={0:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={1:0}, \old(c)=0, c=1, item={3:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={1:0}, \old(c)=0, c=1, item={3:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L537] *plist = item VAL [\old(c)=0, c=1, item={3:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L544] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={31:0}] [L545] length++ VAL [\old(c)=0, c=1, length=1, list={31:0}] [L546] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L547] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={31:0}] [L548] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={31:0}] [L551] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={3:0}, c=1, length=1, list={31:0}] [L551] EXPR list->next VAL [\old(c)=0, \read(*list)={3:0}, c=1, length=1, list={31:0}, list->next={0:0}] [L551] struct item *next = list->next; [L552] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={3:0}, c=1, length=1, list={31:0}, next={0:0}] [L552] free(list) VAL [\old(c)=0, \read(*list)={3:0}, c=1, length=1, list={31:0}, next={0:0}] [L552] free(list) VAL [\old(c)=0, \read(*list)={3:0}, c=1, length=1, list={31:0}, next={0:0}] [L552] free(list) [L553] list = next VAL [\old(c)=0, c=1, length=1, list={31:0}, next={0:0}] [L554] length-- VAL [\old(c)=0, c=1, length=0, list={31:0}, next={0:0}] [L556] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={31:0}, next={0:0}] [L562] return 0; [L541] struct item *list = ((void *)0); [L562] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 124 locations, 45 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 111.3s, OverallIterations: 16, TraceHistogramMax: 2, AutomataDifference: 46.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 879 SDtfs, 1102 SDslu, 3004 SDs, 0 SdLazy, 2750 SolverSat, 159 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 39.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 527 SyntacticMatches, 12 SemanticMatches, 144 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 58.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 184 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 58.0s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 624 ConstructedInterpolants, 33 QuantifiedInterpolants, 138683 SizeOfPredicates, 148 NumberOfNonLiveVariables, 2127 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...