./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232-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_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 aeec7a18a8140b87b664dd42e07dd87d1c028ac9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 aeec7a18a8140b87b664dd42e07dd87d1c028ac9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:55:55,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:55:55,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:55:55,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:55:55,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:55:55,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:55:55,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:55:55,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:55:55,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:55:55,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:55:55,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:55:55,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:55:55,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:55:55,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:55:55,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:55:55,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:55:55,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:55:55,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:55:55,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:55:55,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:55:55,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:55:55,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:55:55,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:55:55,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:55:55,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:55:55,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:55:55,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:55:55,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:55:55,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:55:55,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:55:55,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:55:55,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:55:55,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:55:55,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:55:55,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:55:55,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:55:55,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:55:55,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:55:55,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:55:55,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:55:55,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:55:55,164 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-11-30 00:55:55,204 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:55:55,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:55:55,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:55:55,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:55:55,207 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:55:55,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:55:55,208 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:55:55,208 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:55:55,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:55:55,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:55:55,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:55:55,210 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 00:55:55,210 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 00:55:55,210 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 00:55:55,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:55:55,211 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 00:55:55,211 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:55:55,211 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:55:55,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:55:55,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:55:55,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:55:55,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:55:55,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:55:55,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:55:55,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:55:55,213 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:55:55,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:55:55,213 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:55:55,214 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_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 -> aeec7a18a8140b87b664dd42e07dd87d1c028ac9 [2020-11-30 00:55:55,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:55:55,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:55:55,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:55:55,550 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:55:55,551 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:55:55,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0232-1.i [2020-11-30 00:55:55,625 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/data/6e718ed37/f8142b7247eb423da4997c09f6d58fcf/FLAGc54ccc20f [2020-11-30 00:55:56,150 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:55:56,157 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/sv-benchmarks/c/memsafety/test-0232-1.i [2020-11-30 00:55:56,183 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/data/6e718ed37/f8142b7247eb423da4997c09f6d58fcf/FLAGc54ccc20f [2020-11-30 00:55:56,439 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/data/6e718ed37/f8142b7247eb423da4997c09f6d58fcf [2020-11-30 00:55:56,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:55:56,442 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 00:55:56,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:55:56,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:55:56,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:55:56,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:55:56" (1/1) ... [2020-11-30 00:55:56,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eae4656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:56, skipping insertion in model container [2020-11-30 00:55:56,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:55:56" (1/1) ... [2020-11-30 00:55:56,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:55:56,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:55:56,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:55:56,787 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:55:56,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:55:56,903 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:55:56,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:56 WrapperNode [2020-11-30 00:55:56,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:55:56,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:55:56,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:55:56,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:55:56,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:56" (1/1) ... [2020-11-30 00:55:56,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:56" (1/1) ... [2020-11-30 00:55:56,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:56" (1/1) ... [2020-11-30 00:55:56,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:56" (1/1) ... [2020-11-30 00:55:56,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:56" (1/1) ... [2020-11-30 00:55:56,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:56" (1/1) ... [2020-11-30 00:55:57,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:56" (1/1) ... [2020-11-30 00:55:57,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:55:57,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:55:57,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:55:57,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:55:57,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:55:57,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-30 00:55:57,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:55:57,102 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-30 00:55:57,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-30 00:55:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-30 00:55:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-11-30 00:55:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-11-30 00:55:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-11-30 00:55:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2020-11-30 00:55:57,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-30 00:55:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-30 00:55:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-30 00:55:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-30 00:55:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-30 00:55:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-30 00:55:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:55:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-30 00:55:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-30 00:55:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-30 00:55:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-30 00:55:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-30 00:55:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-30 00:55:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-30 00:55:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-30 00:55:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-30 00:55:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-30 00:55:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-30 00:55:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-30 00:55:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-30 00:55:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-30 00:55:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-30 00:55:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-30 00:55:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-30 00:55:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-30 00:55:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-11-30 00:55:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-11-30 00:55:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-11-30 00:55:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-30 00:55:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-30 00:55:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-30 00:55:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-30 00:55:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-30 00:55:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-30 00:55:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-30 00:55:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-30 00:55:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-30 00:55:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-30 00:55:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-30 00:55:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-30 00:55:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-30 00:55:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-30 00:55:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-30 00:55:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-30 00:55:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-30 00:55:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-30 00:55:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-30 00:55:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-30 00:55:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-30 00:55:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-30 00:55:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-30 00:55:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-30 00:55:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-30 00:55:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-30 00:55:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-30 00:55:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-30 00:55:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-30 00:55:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-30 00:55:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-30 00:55:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-30 00:55:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-30 00:55:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-30 00:55:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-30 00:55:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-30 00:55:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-30 00:55:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-30 00:55:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-30 00:55:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-30 00:55:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-30 00:55:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-30 00:55:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-30 00:55:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-30 00:55:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-30 00:55:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-30 00:55:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-30 00:55:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-30 00:55:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-30 00:55:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-30 00:55:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-30 00:55:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-30 00:55:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-30 00:55:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-30 00:55:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-30 00:55:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-30 00:55:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-30 00:55:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-30 00:55:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-30 00:55:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-30 00:55:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-30 00:55:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-30 00:55:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-30 00:55:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-30 00:55:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-30 00:55:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-30 00:55:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-30 00:55:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-30 00:55:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-30 00:55:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-30 00:55:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-30 00:55:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-30 00:55:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-30 00:55:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-30 00:55:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-30 00:55:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-30 00:55:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-30 00:55:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-30 00:55:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-30 00:55:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-30 00:55:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-30 00:55:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-30 00:55:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-30 00:55:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-30 00:55:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-30 00:55:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-30 00:55:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure append [2020-11-30 00:55:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 00:55:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 00:55:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 00:55:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-30 00:55:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-30 00:55:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:55:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-30 00:55:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:55:57,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:55:57,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:55:57,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:55:57,812 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:55:57,812 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-30 00:55:57,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:55:57 BoogieIcfgContainer [2020-11-30 00:55:57,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:55:57,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:55:57,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:55:57,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:55:57,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:55:56" (1/3) ... [2020-11-30 00:55:57,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75aeb370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:55:57, skipping insertion in model container [2020-11-30 00:55:57,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:56" (2/3) ... [2020-11-30 00:55:57,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75aeb370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:55:57, skipping insertion in model container [2020-11-30 00:55:57,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:55:57" (3/3) ... [2020-11-30 00:55:57,835 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2020-11-30 00:55:57,847 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:55:57,852 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 42 error locations. [2020-11-30 00:55:57,868 INFO L253 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2020-11-30 00:55:57,902 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:55:57,902 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 00:55:57,902 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:55:57,902 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:55:57,902 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:55:57,902 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:55:57,902 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:55:57,902 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:55:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-11-30 00:55:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 00:55:57,938 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:57,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:57,939 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:55:57,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:57,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1751684042, now seen corresponding path program 1 times [2020-11-30 00:55:57,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:57,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856017634] [2020-11-30 00:55:57,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:58,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:55:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:58,207 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 00:55:58,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856017634] [2020-11-30 00:55:58,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:58,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:55:58,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060938277] [2020-11-30 00:55:58,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:55:58,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:58,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:55:58,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:55:58,229 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2020-11-30 00:55:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:58,482 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2020-11-30 00:55:58,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:55:58,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-11-30 00:55:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:58,494 INFO L225 Difference]: With dead ends: 89 [2020-11-30 00:55:58,494 INFO L226 Difference]: Without dead ends: 86 [2020-11-30 00:55:58,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 00:55:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-30 00:55:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-11-30 00:55:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-30 00:55:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2020-11-30 00:55:58,552 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 8 [2020-11-30 00:55:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:58,553 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2020-11-30 00:55:58,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:55:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2020-11-30 00:55:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:55:58,554 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:58,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:58,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:55:58,555 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:55:58,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:58,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1532266366, now seen corresponding path program 1 times [2020-11-30 00:55:58,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:58,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144637750] [2020-11-30 00:55:58,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:58,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:55:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:58,737 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 00:55:58,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144637750] [2020-11-30 00:55:58,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:58,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:55:58,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977532329] [2020-11-30 00:55:58,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:55:58,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:55:58,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:55:58,740 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 6 states. [2020-11-30 00:55:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:59,099 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2020-11-30 00:55:59,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:55:59,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-11-30 00:55:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:59,102 INFO L225 Difference]: With dead ends: 78 [2020-11-30 00:55:59,102 INFO L226 Difference]: Without dead ends: 78 [2020-11-30 00:55:59,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 00:55:59,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-30 00:55:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-11-30 00:55:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-30 00:55:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2020-11-30 00:55:59,110 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 9 [2020-11-30 00:55:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:59,111 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2020-11-30 00:55:59,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:55:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2020-11-30 00:55:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:55:59,111 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:59,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:59,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:55:59,112 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:55:59,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:59,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1532266365, now seen corresponding path program 1 times [2020-11-30 00:55:59,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:59,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554868636] [2020-11-30 00:55:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:59,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:55:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:59,241 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 00:55:59,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554868636] [2020-11-30 00:55:59,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:59,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:55:59,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701835702] [2020-11-30 00:55:59,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:55:59,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:59,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:55:59,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:55:59,244 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2020-11-30 00:55:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:59,645 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2020-11-30 00:55:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:55:59,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-11-30 00:55:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:59,648 INFO L225 Difference]: With dead ends: 96 [2020-11-30 00:55:59,648 INFO L226 Difference]: Without dead ends: 96 [2020-11-30 00:55:59,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 00:55:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-30 00:55:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2020-11-30 00:55:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-30 00:55:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2020-11-30 00:55:59,657 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 9 [2020-11-30 00:55:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:59,657 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2020-11-30 00:55:59,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:55:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2020-11-30 00:55:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:55:59,657 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:59,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:59,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:55:59,658 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:55:59,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:59,659 INFO L82 PathProgramCache]: Analyzing trace with hash -255617013, now seen corresponding path program 1 times [2020-11-30 00:55:59,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:59,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237027683] [2020-11-30 00:55:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:59,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:55:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:59,760 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 00:55:59,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237027683] [2020-11-30 00:55:59,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:59,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:55:59,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890705401] [2020-11-30 00:55:59,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:55:59,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:59,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:55:59,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:55:59,763 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 4 states. [2020-11-30 00:55:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:59,950 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-11-30 00:55:59,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:55:59,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-30 00:55:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:59,952 INFO L225 Difference]: With dead ends: 79 [2020-11-30 00:55:59,952 INFO L226 Difference]: Without dead ends: 79 [2020-11-30 00:55:59,952 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 00:55:59,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-30 00:55:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-30 00:55:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-30 00:55:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2020-11-30 00:55:59,957 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 10 [2020-11-30 00:55:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:59,957 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2020-11-30 00:55:59,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:55:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2020-11-30 00:55:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:55:59,958 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:59,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:59,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:55:59,959 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:55:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash -255617012, now seen corresponding path program 1 times [2020-11-30 00:55:59,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:59,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548519956] [2020-11-30 00:55:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:00,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:00,036 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 00:56:00,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548519956] [2020-11-30 00:56:00,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:00,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:56:00,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818697878] [2020-11-30 00:56:00,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:56:00,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:00,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:56:00,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:56:00,039 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 4 states. [2020-11-30 00:56:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:00,211 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2020-11-30 00:56:00,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:56:00,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-30 00:56:00,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:00,212 INFO L225 Difference]: With dead ends: 75 [2020-11-30 00:56:00,213 INFO L226 Difference]: Without dead ends: 75 [2020-11-30 00:56:00,213 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 00:56:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-30 00:56:00,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-11-30 00:56:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-30 00:56:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2020-11-30 00:56:00,217 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 10 [2020-11-30 00:56:00,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:00,217 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2020-11-30 00:56:00,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:56:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2020-11-30 00:56:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 00:56:00,217 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:00,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:56:00,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:56:00,218 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:00,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:00,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1995559187, now seen corresponding path program 1 times [2020-11-30 00:56:00,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:00,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442092110] [2020-11-30 00:56:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:00,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:00,410 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 00:56:00,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442092110] [2020-11-30 00:56:00,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:00,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 00:56:00,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682558104] [2020-11-30 00:56:00,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:56:00,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:00,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:56:00,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:56:00,412 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2020-11-30 00:56:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:00,821 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2020-11-30 00:56:00,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 00:56:00,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-11-30 00:56:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:00,823 INFO L225 Difference]: With dead ends: 86 [2020-11-30 00:56:00,823 INFO L226 Difference]: Without dead ends: 86 [2020-11-30 00:56:00,824 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 00:56:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-30 00:56:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2020-11-30 00:56:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-30 00:56:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2020-11-30 00:56:00,833 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 15 [2020-11-30 00:56:00,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:00,834 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2020-11-30 00:56:00,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:56:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2020-11-30 00:56:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 00:56:00,835 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:00,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:56:00,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:56:00,835 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:00,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:00,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1732514512, now seen corresponding path program 1 times [2020-11-30 00:56:00,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:00,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113943810] [2020-11-30 00:56:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:00,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:00,952 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 00:56:00,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113943810] [2020-11-30 00:56:00,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:00,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:56:00,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300600175] [2020-11-30 00:56:00,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:56:00,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:00,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:56:00,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:56:00,954 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 8 states. [2020-11-30 00:56:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:01,212 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2020-11-30 00:56:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:56:01,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-30 00:56:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:01,214 INFO L225 Difference]: With dead ends: 81 [2020-11-30 00:56:01,214 INFO L226 Difference]: Without dead ends: 81 [2020-11-30 00:56:01,214 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 00:56:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-11-30 00:56:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2020-11-30 00:56:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-30 00:56:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2020-11-30 00:56:01,222 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 16 [2020-11-30 00:56:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:01,223 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2020-11-30 00:56:01,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:56:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2020-11-30 00:56:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 00:56:01,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:01,224 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 00:56:01,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:56:01,224 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:01,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:01,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1337248604, now seen corresponding path program 1 times [2020-11-30 00:56:01,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:01,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337672007] [2020-11-30 00:56:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:01,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:01,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:56:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:01,435 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 00:56:01,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337672007] [2020-11-30 00:56:01,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:01,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 00:56:01,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641834743] [2020-11-30 00:56:01,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:56:01,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:56:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:56:01,438 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 9 states. [2020-11-30 00:56:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:01,811 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2020-11-30 00:56:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:56:01,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-11-30 00:56:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:01,812 INFO L225 Difference]: With dead ends: 86 [2020-11-30 00:56:01,812 INFO L226 Difference]: Without dead ends: 86 [2020-11-30 00:56:01,812 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 00:56:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-30 00:56:01,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2020-11-30 00:56:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-30 00:56:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2020-11-30 00:56:01,818 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 24 [2020-11-30 00:56:01,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:01,819 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2020-11-30 00:56:01,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:56:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2020-11-30 00:56:01,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 00:56:01,820 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:01,821 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 00:56:01,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:56:01,821 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:01,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:01,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1337248605, now seen corresponding path program 1 times [2020-11-30 00:56:01,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:01,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164836815] [2020-11-30 00:56:01,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:01,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:01,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:56:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:02,088 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 00:56:02,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164836815] [2020-11-30 00:56:02,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:02,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 00:56:02,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247339516] [2020-11-30 00:56:02,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:56:02,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:02,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:56:02,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:56:02,097 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 9 states. [2020-11-30 00:56:02,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:02,512 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2020-11-30 00:56:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:56:02,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-11-30 00:56:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:02,514 INFO L225 Difference]: With dead ends: 88 [2020-11-30 00:56:02,514 INFO L226 Difference]: Without dead ends: 88 [2020-11-30 00:56:02,514 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 00:56:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-30 00:56:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2020-11-30 00:56:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-30 00:56:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2020-11-30 00:56:02,519 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 24 [2020-11-30 00:56:02,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:02,519 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2020-11-30 00:56:02,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:56:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-11-30 00:56:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 00:56:02,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:02,520 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] [2020-11-30 00:56:02,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:56:02,521 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:02,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash 920853620, now seen corresponding path program 1 times [2020-11-30 00:56:02,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:02,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537839653] [2020-11-30 00:56:02,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:02,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:02,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:56:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:02,771 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 00:56:02,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537839653] [2020-11-30 00:56:02,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:02,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 00:56:02,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345378918] [2020-11-30 00:56:02,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:56:02,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:02,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:56:02,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:56:02,774 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 8 states. [2020-11-30 00:56:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:03,117 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-11-30 00:56:03,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:56:03,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-11-30 00:56:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:03,119 INFO L225 Difference]: With dead ends: 70 [2020-11-30 00:56:03,119 INFO L226 Difference]: Without dead ends: 70 [2020-11-30 00:56:03,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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 00:56:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-30 00:56:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-30 00:56:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-30 00:56:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-11-30 00:56:03,127 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 26 [2020-11-30 00:56:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:03,127 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-11-30 00:56:03,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:56:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-11-30 00:56:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 00:56:03,128 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:03,128 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 00:56:03,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:56:03,129 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2143461996, now seen corresponding path program 1 times [2020-11-30 00:56:03,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:03,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359557624] [2020-11-30 00:56:03,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:03,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:03,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:56:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:03,262 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 00:56:03,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359557624] [2020-11-30 00:56:03,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:03,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:56:03,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137786973] [2020-11-30 00:56:03,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:56:03,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:03,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:56:03,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:56:03,265 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 8 states. [2020-11-30 00:56:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:03,513 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-11-30 00:56:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:56:03,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-11-30 00:56:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:03,520 INFO L225 Difference]: With dead ends: 69 [2020-11-30 00:56:03,520 INFO L226 Difference]: Without dead ends: 69 [2020-11-30 00:56:03,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:56:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-30 00:56:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-30 00:56:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 00:56:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-11-30 00:56:03,525 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 27 [2020-11-30 00:56:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:03,525 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-11-30 00:56:03,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:56:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-11-30 00:56:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 00:56:03,526 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:03,526 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 00:56:03,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:56:03,527 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:03,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2022812355, now seen corresponding path program 1 times [2020-11-30 00:56:03,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:03,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126353204] [2020-11-30 00:56:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:03,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:03,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:56:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:03,674 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 00:56:03,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126353204] [2020-11-30 00:56:03,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:03,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:56:03,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664316897] [2020-11-30 00:56:03,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:56:03,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:03,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:56:03,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:56:03,676 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2020-11-30 00:56:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:04,049 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-11-30 00:56:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:56:04,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-11-30 00:56:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:04,052 INFO L225 Difference]: With dead ends: 68 [2020-11-30 00:56:04,052 INFO L226 Difference]: Without dead ends: 68 [2020-11-30 00:56:04,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:56:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-30 00:56:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-11-30 00:56:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-30 00:56:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-11-30 00:56:04,056 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 28 [2020-11-30 00:56:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:04,056 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-11-30 00:56:04,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:56:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-11-30 00:56:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 00:56:04,057 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:04,057 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 00:56:04,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:56:04,057 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash -700341473, now seen corresponding path program 1 times [2020-11-30 00:56:04,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:04,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573359222] [2020-11-30 00:56:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:04,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:04,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:56:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:04,326 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 00:56:04,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573359222] [2020-11-30 00:56:04,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105294387] [2020-11-30 00:56:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:04,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjunts are in the unsatisfiable core [2020-11-30 00:56:04,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:04,735 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 00:56:04,736 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:04,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:04,755 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:56:04,755 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-11-30 00:56:04,852 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:04,853 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 00:56:04,854 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:04,867 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:04,868 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:56:04,868 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:10 [2020-11-30 00:56:04,966 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 00:56:04,966 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:04,984 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:04,988 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 00:56:04,988 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2020-11-30 00:56:05,280 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:05,280 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 00:56:05,281 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:05,314 INFO L625 ElimStorePlain]: treesize reduction 26, result has 48.0 percent of original size [2020-11-30 00:56:05,315 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 00:56:05,316 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2020-11-30 00:56:05,473 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:56:05,502 INFO L350 Elim1Store]: treesize reduction 48, result has 27.3 percent of original size [2020-11-30 00:56:05,502 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 00:56:05,503 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:05,532 INFO L625 ElimStorePlain]: treesize reduction 11, result has 76.1 percent of original size [2020-11-30 00:56:05,535 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 00:56:05,536 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2020-11-30 00:56:05,659 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:05,659 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 00:56:05,660 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:05,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:05,673 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 00:56:05,673 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:11 [2020-11-30 00:56:05,697 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 00:56:05,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:05,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2020-11-30 00:56:05,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528284139] [2020-11-30 00:56:05,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-30 00:56:05,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:05,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-30 00:56:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2020-11-30 00:56:05,702 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 23 states. [2020-11-30 00:56:06,390 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-11-30 00:56:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:07,173 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2020-11-30 00:56:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-30 00:56:07,173 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2020-11-30 00:56:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:07,174 INFO L225 Difference]: With dead ends: 74 [2020-11-30 00:56:07,174 INFO L226 Difference]: Without dead ends: 74 [2020-11-30 00:56:07,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=223, Invalid=967, Unknown=0, NotChecked=0, Total=1190 [2020-11-30 00:56:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-30 00:56:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2020-11-30 00:56:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-30 00:56:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2020-11-30 00:56:07,179 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 29 [2020-11-30 00:56:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:07,179 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2020-11-30 00:56:07,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-30 00:56:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2020-11-30 00:56:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 00:56:07,180 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:07,180 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 00:56:07,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-11-30 00:56:07,402 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash -700341472, now seen corresponding path program 1 times [2020-11-30 00:56:07,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:07,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557065997] [2020-11-30 00:56:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:07,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:07,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:56:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:07,673 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 00:56:07,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557065997] [2020-11-30 00:56:07,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452736092] [2020-11-30 00:56:07,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:07,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 59 conjunts are in the unsatisfiable core [2020-11-30 00:56:07,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:07,908 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 00:56:07,908 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:07,917 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:07,917 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:56:07,918 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-11-30 00:56:07,994 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:07,994 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 00:56:08,001 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:08,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,018 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:56:08,018 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:16 [2020-11-30 00:56:08,138 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 00:56:08,139 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:08,154 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,159 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 00:56:08,159 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:08,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,190 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 00:56:08,190 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:45 [2020-11-30 00:56:08,405 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,405 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 00:56:08,405 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:08,434 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,438 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 22 treesize of output 24 [2020-11-30 00:56:08,438 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:08,454 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,455 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 00:56:08,455 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:52 [2020-11-30 00:56:08,613 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:56:08,632 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 00:56:08,632 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 39 treesize of output 30 [2020-11-30 00:56:08,633 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:08,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,692 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:56:08,731 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 00:56:08,732 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 32 [2020-11-30 00:56:08,732 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:08,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,771 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 00:56:08,771 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:82, output treesize:71 [2020-11-30 00:56:08,914 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,914 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 42 treesize of output 34 [2020-11-30 00:56:08,915 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:08,937 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,951 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,952 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2020-11-30 00:56:08,952 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:08,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:08,973 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 00:56:08,973 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:85, output treesize:23 [2020-11-30 00:56:09,043 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 00:56:09,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:09,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 22 [2020-11-30 00:56:09,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109951195] [2020-11-30 00:56:09,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-30 00:56:09,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:09,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-30 00:56:09,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2020-11-30 00:56:09,050 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 23 states. [2020-11-30 00:56:10,133 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2020-11-30 00:56:10,357 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2020-11-30 00:56:10,774 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2020-11-30 00:56:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:11,368 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-11-30 00:56:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 00:56:11,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2020-11-30 00:56:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:11,369 INFO L225 Difference]: With dead ends: 73 [2020-11-30 00:56:11,369 INFO L226 Difference]: Without dead ends: 73 [2020-11-30 00:56:11,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2020-11-30 00:56:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-30 00:56:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-11-30 00:56:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-30 00:56:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2020-11-30 00:56:11,377 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 29 [2020-11-30 00:56:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:11,377 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2020-11-30 00:56:11,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-30 00:56:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2020-11-30 00:56:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 00:56:11,378 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:11,379 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 00:56:11,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-30 00:56:11,588 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:11,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1717326518, now seen corresponding path program 1 times [2020-11-30 00:56:11,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:11,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138200703] [2020-11-30 00:56:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:11,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:11,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:56:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:11,754 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 00:56:11,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138200703] [2020-11-30 00:56:11,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:11,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 00:56:11,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217836169] [2020-11-30 00:56:11,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:56:11,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:56:11,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:56:11,756 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 9 states. [2020-11-30 00:56:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:12,100 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-11-30 00:56:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:56:12,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-11-30 00:56:12,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:12,101 INFO L225 Difference]: With dead ends: 70 [2020-11-30 00:56:12,101 INFO L226 Difference]: Without dead ends: 70 [2020-11-30 00:56:12,102 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 00:56:12,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-30 00:56:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-30 00:56:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-30 00:56:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-11-30 00:56:12,105 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 29 [2020-11-30 00:56:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:12,105 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-11-30 00:56:12,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:56:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-11-30 00:56:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 00:56:12,106 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:12,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, 1, 1, 1, 1, 1, 1] [2020-11-30 00:56:12,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 00:56:12,106 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:12,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:12,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1697514592, now seen corresponding path program 1 times [2020-11-30 00:56:12,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:12,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15768657] [2020-11-30 00:56:12,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:12,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:12,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:56:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:12,306 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 00:56:12,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15768657] [2020-11-30 00:56:12,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:12,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 00:56:12,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885666754] [2020-11-30 00:56:12,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:56:12,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:12,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:56:12,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:56:12,310 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 9 states. [2020-11-30 00:56:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:12,616 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-11-30 00:56:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:56:12,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-11-30 00:56:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:12,618 INFO L225 Difference]: With dead ends: 69 [2020-11-30 00:56:12,618 INFO L226 Difference]: Without dead ends: 69 [2020-11-30 00:56:12,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:56:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-30 00:56:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-30 00:56:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 00:56:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2020-11-30 00:56:12,621 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2020-11-30 00:56:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:12,621 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-11-30 00:56:12,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:56:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-11-30 00:56:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 00:56:12,623 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:12,623 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 00:56:12,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 00:56:12,623 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:12,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:12,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1697514593, now seen corresponding path program 1 times [2020-11-30 00:56:12,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:12,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211846888] [2020-11-30 00:56:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:12,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:56:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:12,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:56:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:12,765 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 00:56:12,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211846888] [2020-11-30 00:56:12,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:12,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:56:12,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732543242] [2020-11-30 00:56:12,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:56:12,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:12,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:56:12,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:56:12,768 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 6 states. [2020-11-30 00:56:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:12,964 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2020-11-30 00:56:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:56:12,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-11-30 00:56:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:12,965 INFO L225 Difference]: With dead ends: 64 [2020-11-30 00:56:12,965 INFO L226 Difference]: Without dead ends: 64 [2020-11-30 00:56:12,965 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 00:56:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-30 00:56:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-30 00:56:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-30 00:56:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-11-30 00:56:12,968 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 30 [2020-11-30 00:56:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:12,968 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-11-30 00:56:12,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:56:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-11-30 00:56:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-30 00:56:12,969 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:12,969 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 00:56:12,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 00:56:12,970 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:12,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1541696294, now seen corresponding path program 1 times [2020-11-30 00:56:12,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:12,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809901782] [2020-11-30 00:56:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:13,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:13,053 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:13,088 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:13,090 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:56:13,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 00:56:13,122 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-11-30 00:56:13,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:56:13 BoogieIcfgContainer [2020-11-30 00:56:13,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:56:13,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:56:13,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:56:13,144 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:56:13,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:55:57" (3/4) ... [2020-11-30 00:56:13,148 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 00:56:13,148 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:56:13,149 INFO L168 Benchmark]: Toolchain (without parser) took 16706.63 ms. Allocated memory was 100.7 MB in the beginning and 211.8 MB in the end (delta: 111.1 MB). Free memory was 69.7 MB in the beginning and 144.2 MB in the end (delta: -74.5 MB). Peak memory consumption was 35.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:56:13,150 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 77.6 MB. Free memory was 35.7 MB in the beginning and 35.7 MB in the end (delta: 38.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:56:13,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.32 ms. Allocated memory is still 100.7 MB. Free memory was 69.4 MB in the beginning and 66.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:56:13,151 INFO L168 Benchmark]: Boogie Preprocessor took 112.80 ms. Allocated memory is still 100.7 MB. Free memory was 66.2 MB in the beginning and 63.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:56:13,151 INFO L168 Benchmark]: RCFGBuilder took 793.52 ms. Allocated memory is still 100.7 MB. Free memory was 63.5 MB in the beginning and 59.1 MB in the end (delta: 4.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:56:13,152 INFO L168 Benchmark]: TraceAbstraction took 15327.72 ms. Allocated memory was 100.7 MB in the beginning and 211.8 MB in the end (delta: 111.1 MB). Free memory was 58.4 MB in the beginning and 145.3 MB in the end (delta: -86.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:56:13,152 INFO L168 Benchmark]: Witness Printer took 4.76 ms. Allocated memory is still 211.8 MB. Free memory was 145.3 MB in the beginning and 144.2 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:56:13,154 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.50 ms. Allocated memory is still 77.6 MB. Free memory was 35.7 MB in the beginning and 35.7 MB in the end (delta: 38.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 462.32 ms. Allocated memory is still 100.7 MB. Free memory was 69.4 MB in the beginning and 66.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 112.80 ms. Allocated memory is still 100.7 MB. Free memory was 66.2 MB in the beginning and 63.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 793.52 ms. Allocated memory is still 100.7 MB. Free memory was 63.5 MB in the beginning and 59.1 MB in the end (delta: 4.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15327.72 ms. Allocated memory was 100.7 MB in the beginning and 211.8 MB in the end (delta: 111.1 MB). Free memory was 58.4 MB in the beginning and 145.3 MB in the end (delta: -86.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. * Witness Printer took 4.76 ms. Allocated memory is still 211.8 MB. Free memory was 145.3 MB in the beginning and 144.2 MB in the end (delta: 1.0 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: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); VAL [list={3:0}] [L541] CALL append(&list) VAL [plist={3:0}] [L530] struct item *item = malloc(sizeof *item); VAL [item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L531] item->next = *plist VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L532] EXPR item->next VAL [item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L535] *plist = item VAL [item={1:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L541] RET append(&list) VAL [list={3:0}] [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={1:0}, list={3:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={1:0}, list={3:0}] [L544] EXPR list->next VAL [\read(*list)={1:0}, list={3:0}, list->next={0:0}] [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={1:0}, list={3:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={1:0}, list={3:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={1:0}, list={3:0}, next={0:0}] [L545] free(list) [L546] list = next VAL [list={3:0}, next={0:0}] [L548] \read(*list) VAL [\read(*list)={0:0}, list={3:0}, next={0:0}] [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 109 locations, 42 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.1s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 786 SDtfs, 816 SDslu, 2390 SDs, 0 SdLazy, 4068 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred 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, 17 MinimizatonAttempts, 45 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 392 ConstructedInterpolants, 25 QuantifiedInterpolants, 106615 SizeOfPredicates, 41 NumberOfNonLiveVariables, 466 ConjunctsInSsa, 100 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 00:56:15,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:56:15,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:56:16,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:56:16,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:56:16,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:56:16,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:56:16,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:56:16,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:56:16,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:56:16,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:56:16,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:56:16,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:56:16,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:56:16,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:56:16,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:56:16,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:56:16,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:56:16,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:56:16,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:56:16,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:56:16,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:56:16,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:56:16,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:56:16,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:56:16,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:56:16,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:56:16,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:56:16,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:56:16,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:56:16,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:56:16,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:56:16,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:56:16,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:56:16,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:56:16,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:56:16,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:56:16,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:56:16,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:56:16,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:56:16,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:56:16,139 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-11-30 00:56:16,175 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:56:16,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:56:16,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:56:16,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:56:16,181 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:56:16,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:56:16,182 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:56:16,182 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:56:16,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:56:16,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:56:16,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:56:16,184 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 00:56:16,184 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 00:56:16,185 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 00:56:16,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:56:16,185 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 00:56:16,185 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 00:56:16,186 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 00:56:16,186 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:56:16,186 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:56:16,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:56:16,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:56:16,187 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:56:16,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:56:16,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:56:16,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:56:16,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:56:16,188 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-30 00:56:16,188 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 00:56:16,189 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:56:16,189 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 00:56:16,189 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_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 -> aeec7a18a8140b87b664dd42e07dd87d1c028ac9 [2020-11-30 00:56:16,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:56:16,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:56:16,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:56:16,692 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:56:16,693 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:56:16,694 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0232-1.i [2020-11-30 00:56:16,760 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/data/b15af9203/a43fd91e56db48ec9dbfae14ef1b5d6e/FLAG32745c9ad [2020-11-30 00:56:17,402 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:56:17,403 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/sv-benchmarks/c/memsafety/test-0232-1.i [2020-11-30 00:56:17,421 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/data/b15af9203/a43fd91e56db48ec9dbfae14ef1b5d6e/FLAG32745c9ad [2020-11-30 00:56:17,647 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/data/b15af9203/a43fd91e56db48ec9dbfae14ef1b5d6e [2020-11-30 00:56:17,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:56:17,650 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 00:56:17,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:56:17,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:56:17,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:56:17,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:56:17" (1/1) ... [2020-11-30 00:56:17,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc3426a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:17, skipping insertion in model container [2020-11-30 00:56:17,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:56:17" (1/1) ... [2020-11-30 00:56:17,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:56:17,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:56:18,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:56:18,042 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:56:18,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:56:18,169 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:56:18,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:18 WrapperNode [2020-11-30 00:56:18,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:56:18,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:56:18,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:56:18,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:56:18,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:18" (1/1) ... [2020-11-30 00:56:18,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:18" (1/1) ... [2020-11-30 00:56:18,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:18" (1/1) ... [2020-11-30 00:56:18,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:18" (1/1) ... [2020-11-30 00:56:18,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:18" (1/1) ... [2020-11-30 00:56:18,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:18" (1/1) ... [2020-11-30 00:56:18,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:18" (1/1) ... [2020-11-30 00:56:18,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:56:18,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:56:18,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:56:18,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:56:18,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:18,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-30 00:56:18,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:56:18,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-11-30 00:56:18,326 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-30 00:56:18,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-30 00:56:18,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-30 00:56:18,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-11-30 00:56:18,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-11-30 00:56:18,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-11-30 00:56:18,327 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2020-11-30 00:56:18,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-30 00:56:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-30 00:56:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-30 00:56:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-30 00:56:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-30 00:56:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-30 00:56:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:56:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-30 00:56:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-30 00:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-30 00:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-30 00:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-30 00:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-30 00:56:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-30 00:56:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-30 00:56:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-30 00:56:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-30 00:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-30 00:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-30 00:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-30 00:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-30 00:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-30 00:56:18,333 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-30 00:56:18,333 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-30 00:56:18,333 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-30 00:56:18,333 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-11-30 00:56:18,334 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-11-30 00:56:18,334 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-11-30 00:56:18,334 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-30 00:56:18,334 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-30 00:56:18,334 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-30 00:56:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-30 00:56:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-30 00:56:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-30 00:56:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-30 00:56:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-30 00:56:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-30 00:56:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-30 00:56:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-30 00:56:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-30 00:56:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-30 00:56:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-30 00:56:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-30 00:56:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-30 00:56:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-30 00:56:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-30 00:56:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-30 00:56:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-30 00:56:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-30 00:56:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-30 00:56:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-30 00:56:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-30 00:56:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-30 00:56:18,340 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-30 00:56:18,340 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-30 00:56:18,340 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-30 00:56:18,340 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-30 00:56:18,341 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-30 00:56:18,341 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-30 00:56:18,341 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-30 00:56:18,341 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-30 00:56:18,341 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-30 00:56:18,342 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-30 00:56:18,342 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-30 00:56:18,342 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-30 00:56:18,342 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-30 00:56:18,342 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-30 00:56:18,343 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-30 00:56:18,343 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-30 00:56:18,343 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-30 00:56:18,343 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-30 00:56:18,343 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-30 00:56:18,344 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-30 00:56:18,344 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-30 00:56:18,344 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-30 00:56:18,344 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-30 00:56:18,344 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-30 00:56:18,344 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-30 00:56:18,345 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-30 00:56:18,345 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-30 00:56:18,345 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-30 00:56:18,345 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-30 00:56:18,345 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-30 00:56:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-30 00:56:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-30 00:56:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-30 00:56:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-30 00:56:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-30 00:56:18,346 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-30 00:56:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-30 00:56:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-30 00:56:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-30 00:56:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-30 00:56:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-30 00:56:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-30 00:56:18,348 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-30 00:56:18,348 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-30 00:56:18,348 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-30 00:56:18,348 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-30 00:56:18,348 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-30 00:56:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-30 00:56:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-30 00:56:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-30 00:56:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-30 00:56:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-30 00:56:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-30 00:56:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-30 00:56:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-30 00:56:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-30 00:56:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-30 00:56:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-30 00:56:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-30 00:56:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-30 00:56:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-30 00:56:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure append [2020-11-30 00:56:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 00:56:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 00:56:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 00:56:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-30 00:56:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-30 00:56:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:56:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-30 00:56:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 00:56:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:56:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-11-30 00:56:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-11-30 00:56:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-11-30 00:56:19,294 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:56:19,295 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-30 00:56:19,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:56:19 BoogieIcfgContainer [2020-11-30 00:56:19,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:56:19,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:56:19,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:56:19,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:56:19,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:56:17" (1/3) ... [2020-11-30 00:56:19,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd7c8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:56:19, skipping insertion in model container [2020-11-30 00:56:19,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:18" (2/3) ... [2020-11-30 00:56:19,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd7c8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:56:19, skipping insertion in model container [2020-11-30 00:56:19,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:56:19" (3/3) ... [2020-11-30 00:56:19,305 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2020-11-30 00:56:19,316 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:56:19,321 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 42 error locations. [2020-11-30 00:56:19,333 INFO L253 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2020-11-30 00:56:19,353 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:56:19,353 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 00:56:19,353 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:56:19,353 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:56:19,354 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:56:19,354 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:56:19,354 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:56:19,354 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:56:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-11-30 00:56:19,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 00:56:19,377 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:19,378 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:56:19,378 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1603877397, now seen corresponding path program 1 times [2020-11-30 00:56:19,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:19,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182799289] [2020-11-30 00:56:19,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:19,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjunts are in the unsatisfiable core [2020-11-30 00:56:19,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:19,618 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 00:56:19,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:19,640 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 00:56:19,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182799289] [2020-11-30 00:56:19,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:19,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 00:56:19,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849908580] [2020-11-30 00:56:19,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-30 00:56:19,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:56:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 00:56:19,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 00:56:19,668 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2020-11-30 00:56:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:19,698 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2020-11-30 00:56:19,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 00:56:19,700 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-11-30 00:56:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:19,716 INFO L225 Difference]: With dead ends: 88 [2020-11-30 00:56:19,716 INFO L226 Difference]: Without dead ends: 85 [2020-11-30 00:56:19,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 00:56:19,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-30 00:56:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-11-30 00:56:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-30 00:56:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2020-11-30 00:56:19,771 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 8 [2020-11-30 00:56:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:19,771 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2020-11-30 00:56:19,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-30 00:56:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2020-11-30 00:56:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:56:19,773 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:19,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:56:19,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 00:56:19,994 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:19,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:19,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1819511446, now seen corresponding path program 1 times [2020-11-30 00:56:19,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:19,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649113221] [2020-11-30 00:56:19,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:20,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:56:20,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:20,222 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 00:56:20,223 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:20,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:20,227 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:56:20,228 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 00:56:20,302 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:20,302 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 41 [2020-11-30 00:56:20,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:56:20,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:56:20,332 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:20,357 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2020-11-30 00:56:20,359 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 00:56:20,359 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2020-11-30 00:56:20,387 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 00:56:20,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:25,198 WARN L193 SmtUtils]: Spent 734.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-11-30 00:56:27,770 WARN L193 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-11-30 00:56:27,871 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 00:56:27,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649113221] [2020-11-30 00:56:27,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:27,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 00:56:27,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435809555] [2020-11-30 00:56:27,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:56:27,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:56:27,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:56:27,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2020-11-30 00:56:27,875 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 8 states. [2020-11-30 00:56:28,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:28,552 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2020-11-30 00:56:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:56:28,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-11-30 00:56:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:28,557 INFO L225 Difference]: With dead ends: 77 [2020-11-30 00:56:28,557 INFO L226 Difference]: Without dead ends: 77 [2020-11-30 00:56:28,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=22, Invalid=47, Unknown=3, NotChecked=0, Total=72 [2020-11-30 00:56:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-30 00:56:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-30 00:56:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-30 00:56:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2020-11-30 00:56:28,572 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 9 [2020-11-30 00:56:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:28,572 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2020-11-30 00:56:28,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:56:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2020-11-30 00:56:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:56:28,574 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:28,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:56:28,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 00:56:28,791 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:28,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1819511447, now seen corresponding path program 1 times [2020-11-30 00:56:28,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:28,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626588232] [2020-11-30 00:56:28,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:28,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 00:56:28,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:28,986 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 00:56:28,986 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:29,004 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:29,009 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 00:56:29,009 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:29,020 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:29,020 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:56:29,020 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 00:56:29,124 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:29,124 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 00:56:29,126 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:29,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:29,154 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 00:56:29,155 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:29,181 INFO L625 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2020-11-30 00:56:29,182 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 00:56:29,182 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-11-30 00:56:29,204 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 00:56:29,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:29,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:56:29,882 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-11-30 00:56:31,911 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_append_#t~malloc5.base_3| (_ BitVec 32))) (or (bvule (bvadd |c_main_~#list~0.offset| (_ bv4 32)) (select (store |c_#length| |v_append_#t~malloc5.base_3| (_ bv8 32)) |c_main_~#list~0.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_append_#t~malloc5.base_3|))))) (or (forall ((v_prenex_1 (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| v_prenex_1)))) (bvule |c_main_~#list~0.offset| (bvadd |c_main_~#list~0.offset| (_ bv4 32))))) is different from false [2020-11-30 00:56:31,939 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 00:56:31,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626588232] [2020-11-30 00:56:31,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:31,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 00:56:31,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084285666] [2020-11-30 00:56:31,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:56:31,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:56:31,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:56:31,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2020-11-30 00:56:31,941 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 8 states. [2020-11-30 00:56:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:32,816 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2020-11-30 00:56:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:56:32,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-11-30 00:56:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:32,819 INFO L225 Difference]: With dead ends: 94 [2020-11-30 00:56:32,819 INFO L226 Difference]: Without dead ends: 94 [2020-11-30 00:56:32,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=27, Invalid=48, Unknown=1, NotChecked=14, Total=90 [2020-11-30 00:56:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-30 00:56:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2020-11-30 00:56:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-30 00:56:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2020-11-30 00:56:32,829 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 9 [2020-11-30 00:56:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:32,830 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2020-11-30 00:56:32,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:56:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-11-30 00:56:32,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:56:32,830 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:32,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:56:33,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 00:56:33,042 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:33,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:33,042 INFO L82 PathProgramCache]: Analyzing trace with hash 570280076, now seen corresponding path program 1 times [2020-11-30 00:56:33,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:33,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426334891] [2020-11-30 00:56:33,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:33,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:56:33,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:33,175 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 00:56:33,175 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:33,178 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:33,178 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:56:33,179 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 00:56:33,191 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 00:56:33,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:33,201 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 00:56:33,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426334891] [2020-11-30 00:56:33,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:33,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 00:56:33,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148080406] [2020-11-30 00:56:33,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:56:33,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:56:33,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:56:33,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:56:33,203 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 3 states. [2020-11-30 00:56:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:33,376 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2020-11-30 00:56:33,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:56:33,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-30 00:56:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:33,378 INFO L225 Difference]: With dead ends: 74 [2020-11-30 00:56:33,378 INFO L226 Difference]: Without dead ends: 74 [2020-11-30 00:56:33,378 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 00:56:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-30 00:56:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-11-30 00:56:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-30 00:56:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2020-11-30 00:56:33,385 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 10 [2020-11-30 00:56:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:33,389 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2020-11-30 00:56:33,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:56:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2020-11-30 00:56:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:56:33,390 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:33,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:56:33,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 00:56:33,608 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash 570280077, now seen corresponding path program 1 times [2020-11-30 00:56:33,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:33,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864820729] [2020-11-30 00:56:33,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:33,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:56:33,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:33,765 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 00:56:33,766 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:33,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:33,773 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:56:33,773 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 00:56:33,782 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 00:56:33,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:33,844 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 00:56:33,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864820729] [2020-11-30 00:56:33,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:33,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-11-30 00:56:33,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097708184] [2020-11-30 00:56:33,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:56:33,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:56:33,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:56:33,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:56:33,846 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2020-11-30 00:56:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:34,102 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2020-11-30 00:56:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:56:34,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-30 00:56:34,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:34,104 INFO L225 Difference]: With dead ends: 70 [2020-11-30 00:56:34,104 INFO L226 Difference]: Without dead ends: 70 [2020-11-30 00:56:34,104 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 00:56:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-30 00:56:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-30 00:56:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-30 00:56:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2020-11-30 00:56:34,110 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2020-11-30 00:56:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:34,110 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2020-11-30 00:56:34,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:56:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2020-11-30 00:56:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 00:56:34,112 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:34,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:56:34,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 00:56:34,326 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:34,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:34,326 INFO L82 PathProgramCache]: Analyzing trace with hash -771427871, now seen corresponding path program 1 times [2020-11-30 00:56:34,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:34,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648660003] [2020-11-30 00:56:34,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:34,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 00:56:34,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:34,602 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 00:56:34,602 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 00:56:34,603 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:34,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:34,666 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 00:56:34,667 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 00:56:34,667 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:34,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:34,680 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 00:56:34,681 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2020-11-30 00:56:34,796 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:34,797 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 00:56:34,797 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:34,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:34,829 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:34,829 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 22 treesize of output 22 [2020-11-30 00:56:34,830 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:34,853 INFO L625 ElimStorePlain]: treesize reduction 12, result has 36.8 percent of original size [2020-11-30 00:56:34,853 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:56:34,854 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:7 [2020-11-30 00:56:34,872 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 00:56:34,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:34,952 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 00:56:34,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648660003] [2020-11-30 00:56:34,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:34,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2020-11-30 00:56:34,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892697570] [2020-11-30 00:56:34,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:56:34,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:56:34,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:56:34,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:56:34,954 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 10 states. [2020-11-30 00:56:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:35,908 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2020-11-30 00:56:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:56:35,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-11-30 00:56:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:35,910 INFO L225 Difference]: With dead ends: 82 [2020-11-30 00:56:35,910 INFO L226 Difference]: Without dead ends: 82 [2020-11-30 00:56:35,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:56:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-30 00:56:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2020-11-30 00:56:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-30 00:56:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2020-11-30 00:56:35,918 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2020-11-30 00:56:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:35,919 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2020-11-30 00:56:35,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:56:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2020-11-30 00:56:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 00:56:35,921 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:35,921 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] [2020-11-30 00:56:36,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 00:56:36,126 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:36,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:36,126 INFO L82 PathProgramCache]: Analyzing trace with hash 195740584, now seen corresponding path program 1 times [2020-11-30 00:56:36,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:36,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064304492] [2020-11-30 00:56:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:36,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 00:56:36,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:36,368 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 00:56:36,368 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:36,391 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:36,397 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 00:56:36,397 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:36,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:36,409 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 00:56:36,410 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-11-30 00:56:36,462 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 00:56:36,463 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:36,474 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:36,476 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 00:56:36,476 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:36,484 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:36,484 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 00:56:36,484 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2020-11-30 00:56:36,507 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 00:56:36,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:36,913 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 00:56:36,916 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 00:56:36,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:36,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:56:36,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:56:36,951 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:36,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:36,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:56:36,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:56:36,982 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:37,003 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:37,003 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-11-30 00:56:37,003 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:19 [2020-11-30 00:56:37,123 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-11-30 00:56:37,152 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 00:56:37,153 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 00:56:37,173 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 00:56:37,174 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 00:56:37,196 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 00:56:37,197 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 00:56:37,215 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 00:56:37,216 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 00:56:37,301 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:37,303 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 00:56:37,303 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2020-11-30 00:56:37,513 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 00:56:37,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064304492] [2020-11-30 00:56:37,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:37,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2020-11-30 00:56:37,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338232867] [2020-11-30 00:56:37,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 00:56:37,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:56:37,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 00:56:37,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:56:37,515 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 12 states. [2020-11-30 00:56:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:38,563 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2020-11-30 00:56:38,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:56:38,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-11-30 00:56:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:38,566 INFO L225 Difference]: With dead ends: 88 [2020-11-30 00:56:38,566 INFO L226 Difference]: Without dead ends: 88 [2020-11-30 00:56:38,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:56:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-30 00:56:38,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2020-11-30 00:56:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-30 00:56:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2020-11-30 00:56:38,573 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2020-11-30 00:56:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:38,574 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2020-11-30 00:56:38,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 00:56:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-11-30 00:56:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 00:56:38,575 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:38,575 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] [2020-11-30 00:56:38,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 00:56:38,776 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:38,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:38,777 INFO L82 PathProgramCache]: Analyzing trace with hash 195740583, now seen corresponding path program 1 times [2020-11-30 00:56:38,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:38,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939779926] [2020-11-30 00:56:38,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:38,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:56:38,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:38,956 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 00:56:38,956 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:38,964 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:38,965 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 00:56:38,965 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-11-30 00:56:38,995 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 00:56:38,995 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:39,002 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:39,002 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 00:56:39,002 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-11-30 00:56:39,012 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 00:56:39,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:39,099 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 00:56:39,100 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 00:56:39,129 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:39,130 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 00:56:39,130 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-11-30 00:56:39,230 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 00:56:39,244 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 00:56:39,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939779926] [2020-11-30 00:56:39,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:39,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-11-30 00:56:39,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49769154] [2020-11-30 00:56:39,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:56:39,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:56:39,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:56:39,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:56:39,246 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 8 states. [2020-11-30 00:56:39,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:39,713 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2020-11-30 00:56:39,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:56:39,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-11-30 00:56:39,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:39,714 INFO L225 Difference]: With dead ends: 84 [2020-11-30 00:56:39,714 INFO L226 Difference]: Without dead ends: 84 [2020-11-30 00:56:39,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:56:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-30 00:56:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2020-11-30 00:56:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-30 00:56:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2020-11-30 00:56:39,721 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 23 [2020-11-30 00:56:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:39,722 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2020-11-30 00:56:39,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:56:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2020-11-30 00:56:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 00:56:39,723 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:39,723 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 00:56:39,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 00:56:39,924 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:39,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:39,924 INFO L82 PathProgramCache]: Analyzing trace with hash -851693409, now seen corresponding path program 1 times [2020-11-30 00:56:39,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:39,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128838298] [2020-11-30 00:56:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:40,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:56:40,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:40,127 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 00:56:40,127 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:40,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:40,134 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 00:56:40,134 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-11-30 00:56:40,158 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 00:56:40,158 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:40,161 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:40,161 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 00:56:40,161 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-11-30 00:56:40,172 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 00:56:40,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:40,273 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 30 treesize of output 26 [2020-11-30 00:56:40,274 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 00:56:40,294 INFO L625 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2020-11-30 00:56:40,294 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-11-30 00:56:40,294 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2020-11-30 00:56:40,307 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 00:56:40,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128838298] [2020-11-30 00:56:40,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:40,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 00:56:40,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685191303] [2020-11-30 00:56:40,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:56:40,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:56:40,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:56:40,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:56:40,309 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2020-11-30 00:56:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:40,719 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-11-30 00:56:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:56:40,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-30 00:56:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:40,721 INFO L225 Difference]: With dead ends: 69 [2020-11-30 00:56:40,721 INFO L226 Difference]: Without dead ends: 69 [2020-11-30 00:56:40,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 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 00:56:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-30 00:56:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-30 00:56:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 00:56:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-11-30 00:56:40,726 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 25 [2020-11-30 00:56:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:40,726 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-11-30 00:56:40,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:56:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-11-30 00:56:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 00:56:40,727 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:40,727 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] [2020-11-30 00:56:40,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 00:56:40,928 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:40,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1257845026, now seen corresponding path program 1 times [2020-11-30 00:56:40,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:40,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695162765] [2020-11-30 00:56:40,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:41,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:56:41,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:41,092 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 00:56:41,092 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:41,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:41,096 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:56:41,096 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-11-30 00:56:41,122 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 00:56:41,123 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:41,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:41,125 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 00:56:41,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-11-30 00:56:41,133 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 00:56:41,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:41,248 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 00:56:41,250 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 00:56:41,259 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:41,259 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-11-30 00:56:41,260 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2020-11-30 00:56:41,269 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 00:56:41,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695162765] [2020-11-30 00:56:41,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:41,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 00:56:41,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61989923] [2020-11-30 00:56:41,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:56:41,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:56:41,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:56:41,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:56:41,270 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 6 states. [2020-11-30 00:56:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:41,502 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-11-30 00:56:41,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:56:41,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-30 00:56:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:41,503 INFO L225 Difference]: With dead ends: 68 [2020-11-30 00:56:41,503 INFO L226 Difference]: Without dead ends: 68 [2020-11-30 00:56:41,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 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 00:56:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-30 00:56:41,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-11-30 00:56:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-30 00:56:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-11-30 00:56:41,508 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2020-11-30 00:56:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:41,508 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-11-30 00:56:41,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:56:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-11-30 00:56:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 00:56:41,509 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:41,509 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] [2020-11-30 00:56:41,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 00:56:41,710 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash -25957239, now seen corresponding path program 1 times [2020-11-30 00:56:41,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:41,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825625103] [2020-11-30 00:56:41,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:41,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-30 00:56:41,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:41,941 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 00:56:41,941 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:41,949 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:41,950 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 00:56:41,950 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-11-30 00:56:42,017 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:42,017 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 00:56:42,018 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:42,037 INFO L625 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2020-11-30 00:56:42,037 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:56:42,037 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-11-30 00:56:42,131 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 00:56:42,132 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 00:56:42,132 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:42,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:42,148 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 00:56:42,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-11-30 00:56:42,231 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:42,231 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 30 treesize of output 26 [2020-11-30 00:56:42,232 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:42,242 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:42,242 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 00:56:42,243 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:13 [2020-11-30 00:56:42,290 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 00:56:42,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:42,491 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 00:56:42,492 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 00:56:42,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:42,546 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 00:56:42,546 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-11-30 00:56:42,637 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 00:56:42,647 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 00:56:42,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825625103] [2020-11-30 00:56:42,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:42,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-11-30 00:56:42,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929293824] [2020-11-30 00:56:42,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 00:56:42,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:56:42,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 00:56:42,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:56:42,648 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 14 states. [2020-11-30 00:56:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:45,726 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2020-11-30 00:56:45,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:56:45,727 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2020-11-30 00:56:45,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:56:45,728 INFO L225 Difference]: With dead ends: 74 [2020-11-30 00:56:45,728 INFO L226 Difference]: Without dead ends: 74 [2020-11-30 00:56:45,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:56:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-30 00:56:45,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2020-11-30 00:56:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-30 00:56:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2020-11-30 00:56:45,733 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 28 [2020-11-30 00:56:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:56:45,733 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2020-11-30 00:56:45,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 00:56:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2020-11-30 00:56:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 00:56:45,734 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:56:45,734 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] [2020-11-30 00:56:45,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-30 00:56:45,935 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:56:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:45,935 INFO L82 PathProgramCache]: Analyzing trace with hash -25957238, now seen corresponding path program 1 times [2020-11-30 00:56:45,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:56:45,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654226032] [2020-11-30 00:56:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:56:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:46,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2020-11-30 00:56:46,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:46,189 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 00:56:46,189 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:46,204 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:46,228 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 00:56:46,229 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:46,244 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:46,244 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 00:56:46,244 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2020-11-30 00:56:46,303 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:46,303 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 00:56:46,304 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:46,318 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:46,326 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 00:56:46,326 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:46,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:46,345 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 00:56:46,345 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2020-11-30 00:56:46,516 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 00:56:46,517 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 00:56:46,517 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:46,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:46,568 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-30 00:56:46,568 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 00:56:46,569 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:46,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:46,590 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 00:56:46,590 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2020-11-30 00:56:46,681 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 00:56:46,682 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:46,716 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:46,719 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 25 treesize of output 13 [2020-11-30 00:56:46,720 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:56:46,734 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:46,734 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 00:56:46,734 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:18 [2020-11-30 00:56:46,776 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 00:56:46,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:56:47,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:56:51,312 WARN L193 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 28 [2020-11-30 00:56:53,220 WARN L193 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-30 00:56:57,526 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 00:56:57,527 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 00:56:57,661 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-11-30 00:56:57,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:57,673 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 00:56:57,674 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 00:56:57,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:56:57,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:56:57,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:56:57,679 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 00:56:57,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:56:57,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:56:57,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:56:57,682 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 00:56:57,950 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2020-11-30 00:56:57,951 INFO L625 ElimStorePlain]: treesize reduction 56, result has 59.7 percent of original size [2020-11-30 00:56:57,966 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 00:56:57,969 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2020-11-30 00:56:58,099 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-11-30 00:56:58,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:56:58,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:56:58,102 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 00:56:58,103 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 00:56:58,106 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 00:56:58,106 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2020-11-30 00:56:58,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:56:58,107 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 00:56:58,108 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 00:57:09,059 WARN L193 SmtUtils]: Spent 4.13 s on a formula simplification that was a NOOP. DAG size: 43 [2020-11-30 00:57:09,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:57:09,062 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 00:57:09,063 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 00:57:42,989 WARN L193 SmtUtils]: Spent 22.94 s on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2020-11-30 00:57:42,991 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-11-30 00:57:42,999 INFO L441 ElimStorePlain]: Different costs {2=[|#length|], 10=[|#valid|]} [2020-11-30 00:57:43,011 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:57:43,012 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:57:43,021 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 00:57:43,021 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 00:57:43,047 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 00:57:43,048 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 00:57:43,059 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 00:57:43,060 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 00:57:43,130 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:57:43,145 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:57:43,145 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 00:57:43,146 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-30 00:57:43,167 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:57:43,168 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 00:57:43,168 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-30 00:57:43,197 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:57:43,197 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 00:57:43,197 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-11-30 00:57:43,253 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:57:43,256 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2020-11-30 00:57:43,256 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:108, output treesize:35 [2020-11-30 00:57:47,487 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 00:57:47,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654226032] [2020-11-30 00:57:47,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:57:47,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2020-11-30 00:57:47,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893416211] [2020-11-30 00:57:47,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 00:57:47,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:57:47,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 00:57:47,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=290, Unknown=5, NotChecked=0, Total=342 [2020-11-30 00:57:47,491 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 19 states. [2020-11-30 00:57:48,701 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-11-30 00:57:51,275 WARN L193 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2020-11-30 00:57:53,576 WARN L193 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-11-30 00:57:56,138 WARN L193 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2020-11-30 00:57:56,514 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-30 00:58:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:00,286 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-11-30 00:58:00,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 00:58:00,288 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-11-30 00:58:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:00,289 INFO L225 Difference]: With dead ends: 73 [2020-11-30 00:58:00,289 INFO L226 Difference]: Without dead ends: 73 [2020-11-30 00:58:00,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 67.5s TimeCoverageRelationStatistics Valid=163, Invalid=588, Unknown=5, NotChecked=0, Total=756 [2020-11-30 00:58:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-30 00:58:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-11-30 00:58:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-30 00:58:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2020-11-30 00:58:00,293 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 28 [2020-11-30 00:58:00,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:00,293 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2020-11-30 00:58:00,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 00:58:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2020-11-30 00:58:00,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 00:58:00,294 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:00,294 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 00:58:00,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-11-30 00:58:00,495 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:58:00,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:00,495 INFO L82 PathProgramCache]: Analyzing trace with hash -338490040, now seen corresponding path program 1 times [2020-11-30 00:58:00,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:58:00,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812746239] [2020-11-30 00:58:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:58:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:00,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 00:58:00,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:58:00,679 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 00:58:00,679 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:00,687 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:00,687 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 00:58:00,688 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2020-11-30 00:58:00,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 23 treesize of output 11 [2020-11-30 00:58:00,735 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:00,739 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:00,740 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 00:58:00,740 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2020-11-30 00:58:00,756 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 00:58:00,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:58:00,923 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 00:58:00,923 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 00:58:00,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:00,952 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 00:58:00,952 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2020-11-30 00:58:01,007 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 00:58:01,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812746239] [2020-11-30 00:58:01,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:01,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2020-11-30 00:58:01,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673602116] [2020-11-30 00:58:01,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 00:58:01,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:58:01,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:58:01,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:58:01,008 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 11 states. [2020-11-30 00:58:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:01,630 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-11-30 00:58:01,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 00:58:01,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-11-30 00:58:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:01,632 INFO L225 Difference]: With dead ends: 70 [2020-11-30 00:58:01,632 INFO L226 Difference]: Without dead ends: 70 [2020-11-30 00:58:01,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:58:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-30 00:58:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-30 00:58:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-30 00:58:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-11-30 00:58:01,642 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 27 [2020-11-30 00:58:01,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:01,643 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-11-30 00:58:01,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 00:58:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-11-30 00:58:01,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 00:58:01,644 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:01,644 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 00:58:01,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-11-30 00:58:01,854 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:58:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1903256544, now seen corresponding path program 1 times [2020-11-30 00:58:01,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:58:01,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464951363] [2020-11-30 00:58:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:58:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:02,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:58:02,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:58:02,052 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 00:58:02,052 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:02,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:02,058 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 00:58:02,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-11-30 00:58:02,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 19 treesize of output 11 [2020-11-30 00:58:02,085 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:02,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:02,087 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 00:58:02,087 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-11-30 00:58:02,103 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 00:58:02,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:58:02,190 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 00:58:02,191 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 00:58:02,237 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:02,238 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 00:58:02,238 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-11-30 00:58:02,345 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 00:58:02,360 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 00:58:02,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464951363] [2020-11-30 00:58:02,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:02,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-11-30 00:58:02,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939917229] [2020-11-30 00:58:02,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:58:02,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:58:02,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:58:02,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:58:02,361 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 8 states. [2020-11-30 00:58:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:02,849 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-11-30 00:58:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:58:02,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-11-30 00:58:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:02,855 INFO L225 Difference]: With dead ends: 69 [2020-11-30 00:58:02,855 INFO L226 Difference]: Without dead ends: 69 [2020-11-30 00:58:02,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 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 00:58:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-30 00:58:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-30 00:58:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 00:58:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2020-11-30 00:58:02,858 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 28 [2020-11-30 00:58:02,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:02,859 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-11-30 00:58:02,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:58:02,859 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-11-30 00:58:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 00:58:02,860 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:02,860 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 00:58:03,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-11-30 00:58:03,060 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:58:03,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1128589387, now seen corresponding path program 1 times [2020-11-30 00:58:03,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:58:03,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725201575] [2020-11-30 00:58:03,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:58:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:03,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 00:58:03,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:58:03,225 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 00:58:03,225 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:03,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:03,227 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:58:03,227 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 00:58:03,259 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 00:58:03,259 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:03,268 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:03,269 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 00:58:03,269 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2020-11-30 00:58:03,295 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:03,295 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 00:58:03,296 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:03,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:03,306 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:58:03,306 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2020-11-30 00:58:03,329 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 00:58:03,329 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:03,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:03,334 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 00:58:03,334 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2020-11-30 00:58:03,352 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 00:58:03,352 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:03,361 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-11-30 00:58:03,361 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 00:58:03,361 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2020-11-30 00:58:03,379 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 00:58:03,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:58:03,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:58:03,484 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 00:58:03,484 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:03,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:03,486 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:58:03,486 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:6 [2020-11-30 00:58:03,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:58:03,548 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 00:58:03,549 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:03,562 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:03,562 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 00:58:03,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:58:03,565 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:58:03,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:03,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:58:03,601 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 00:58:03,606 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-11-30 00:58:03,643 INFO L625 ElimStorePlain]: treesize reduction 5, result has 83.9 percent of original size [2020-11-30 00:58:03,643 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 00:58:03,643 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:50, output treesize:26 [2020-11-30 00:58:03,714 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 00:58:03,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725201575] [2020-11-30 00:58:03,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:03,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2020-11-30 00:58:03,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138314049] [2020-11-30 00:58:03,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 00:58:03,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:58:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 00:58:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:58:03,715 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 12 states. [2020-11-30 00:58:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:08,330 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2020-11-30 00:58:08,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:58:08,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2020-11-30 00:58:08,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:08,331 INFO L225 Difference]: With dead ends: 84 [2020-11-30 00:58:08,331 INFO L226 Difference]: Without dead ends: 84 [2020-11-30 00:58:08,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 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 00:58:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-30 00:58:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2020-11-30 00:58:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-30 00:58:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2020-11-30 00:58:08,337 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2020-11-30 00:58:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:08,337 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2020-11-30 00:58:08,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 00:58:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2020-11-30 00:58:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 00:58:08,337 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:08,338 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 00:58:08,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-11-30 00:58:08,542 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:58:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:08,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1128589388, now seen corresponding path program 1 times [2020-11-30 00:58:08,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:58:08,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879101437] [2020-11-30 00:58:08,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/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 00:58:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:08,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:58:08,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:58:08,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 00:58:08,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:58:08,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:58:08,773 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 00:58:08,773 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 00:58:08,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:58:08,790 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 00:58:08,790 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2020-11-30 00:58:08,823 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 00:58:08,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879101437] [2020-11-30 00:58:08,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:08,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-30 00:58:08,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605285260] [2020-11-30 00:58:08,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:58:08,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:58:08,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:58:08,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:58:08,824 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 6 states. [2020-11-30 00:58:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:08,973 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2020-11-30 00:58:08,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:58:08,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-11-30 00:58:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:08,975 INFO L225 Difference]: With dead ends: 63 [2020-11-30 00:58:08,975 INFO L226 Difference]: Without dead ends: 63 [2020-11-30 00:58:08,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 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 00:58:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-30 00:58:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-30 00:58:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-30 00:58:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2020-11-30 00:58:08,978 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 29 [2020-11-30 00:58:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:08,978 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2020-11-30 00:58:08,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:58:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2020-11-30 00:58:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 00:58:08,979 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:08,979 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] [2020-11-30 00:58:09,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-11-30 00:58:09,186 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, 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 00:58:09,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:09,187 INFO L82 PathProgramCache]: Analyzing trace with hash -892649775, now seen corresponding path program 1 times [2020-11-30 00:58:09,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:58:09,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144416611] [2020-11-30 00:58:09,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d018ed1a-f996-49d7-8b05-0af2d804b8c6/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-11-30 00:58:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:58:09,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:58:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:58:09,457 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:58:09,501 INFO L173 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-11-30 00:58:09,501 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:58:09,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-11-30 00:58:09,720 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-11-30 00:58:09,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:58:09 BoogieIcfgContainer [2020-11-30 00:58:09,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:58:09,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:58:09,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:58:09,736 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:58:09,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:56:19" (3/4) ... [2020-11-30 00:58:09,739 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 00:58:09,739 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:58:09,740 INFO L168 Benchmark]: Toolchain (without parser) took 112090.15 ms. Allocated memory was 54.5 MB in the beginning and 111.1 MB in the end (delta: 56.6 MB). Free memory was 31.7 MB in the beginning and 47.2 MB in the end (delta: -15.4 MB). Peak memory consumption was 40.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:58:09,741 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 54.5 MB. Free memory is still 36.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:58:09,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.60 ms. Allocated memory is still 54.5 MB. Free memory was 31.5 MB in the beginning and 24.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:58:09,741 INFO L168 Benchmark]: Boogie Preprocessor took 88.75 ms. Allocated memory was 54.5 MB in the beginning and 71.3 MB in the end (delta: 16.8 MB). Free memory was 24.2 MB in the beginning and 53.5 MB in the end (delta: -29.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:58:09,742 INFO L168 Benchmark]: RCFGBuilder took 1037.06 ms. Allocated memory is still 71.3 MB. Free memory was 53.5 MB in the beginning and 40.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:58:09,742 INFO L168 Benchmark]: TraceAbstraction took 110436.65 ms. Allocated memory was 71.3 MB in the beginning and 111.1 MB in the end (delta: 39.8 MB). Free memory was 40.2 MB in the beginning and 47.2 MB in the end (delta: -7.0 MB). Peak memory consumption was 31.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:58:09,742 INFO L168 Benchmark]: Witness Printer took 3.62 ms. Allocated memory is still 111.1 MB. Free memory is still 47.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:58:09,744 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.28 ms. Allocated memory is still 54.5 MB. Free memory is still 36.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 518.60 ms. Allocated memory is still 54.5 MB. Free memory was 31.5 MB in the beginning and 24.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 88.75 ms. Allocated memory was 54.5 MB in the beginning and 71.3 MB in the end (delta: 16.8 MB). Free memory was 24.2 MB in the beginning and 53.5 MB in the end (delta: -29.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1037.06 ms. Allocated memory is still 71.3 MB. Free memory was 53.5 MB in the beginning and 40.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 110436.65 ms. Allocated memory was 71.3 MB in the beginning and 111.1 MB in the end (delta: 39.8 MB). Free memory was 40.2 MB in the beginning and 47.2 MB in the end (delta: -7.0 MB). Peak memory consumption was 31.6 MB. Max. memory is 16.1 GB. * Witness Printer took 3.62 ms. Allocated memory is still 111.1 MB. Free memory is still 47.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: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); VAL [list={31:0}] [L541] CALL append(&list) VAL [plist={31:0}] [L530] struct item *item = malloc(sizeof *item); VAL [item={3:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={3:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L531] item->next = *plist VAL [\read(**plist)={0:0}, item={3:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L532] EXPR item->next VAL [item={3:0}, item->next={0:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={1:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={1:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L535] *plist = item VAL [item={3:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L541] RET append(&list) VAL [list={31:0}] [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={3:0}, list={31:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={3:0}, list={31:0}] [L544] EXPR list->next VAL [\read(*list)={3:0}, list={31:0}, list->next={0:0}] [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={3:0}, list={31:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={31:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={31:0}, next={0:0}] [L545] free(list) [L546] list = next VAL [list={31:0}, next={0:0}] [L548] \read(*list) VAL [\read(*list)={0:0}, list={31:0}, next={0:0}] [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 114 locations, 42 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 110.3s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 780 SDtfs, 852 SDslu, 2307 SDs, 0 SdLazy, 2515 SolverSat, 146 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 684 GetRequests, 524 SyntacticMatches, 11 SemanticMatches, 149 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 81.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred 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, 16 MinimizatonAttempts, 62 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 76.8s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 622 ConstructedInterpolants, 41 QuantifiedInterpolants, 131501 SizeOfPredicates, 158 NumberOfNonLiveVariables, 2083 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 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...