./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/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 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:18:13,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:18:13,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:18:13,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:18:13,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:18:13,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:18:13,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:18:13,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:18:13,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:18:13,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:18:13,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:18:13,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:18:13,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:18:13,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:18:13,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:18:13,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:18:13,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:18:13,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:18:13,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:18:13,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:18:13,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:18:13,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:18:13,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:18:13,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:18:13,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:18:13,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:18:13,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:18:13,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:18:13,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:18:13,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:18:13,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:18:13,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:18:13,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:18:13,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:18:13,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:18:13,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:18:13,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:18:13,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:18:13,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:18:13,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:18:13,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:18:13,112 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-15 23:18:13,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:18:13,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:18:13,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:18:13,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:18:13,137 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:18:13,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:18:13,145 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:18:13,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:18:13,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:18:13,146 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:18:13,147 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:18:13,147 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:18:13,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:18:13,148 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:18:13,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:18:13,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:18:13,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:18:13,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:18:13,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:18:13,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:18:13,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:18:13,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:18:13,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:18:13,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_910b3f39-6b2b-4ec0-ad48-5581587d4e01/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-11-15 23:18:13,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:18:13,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:18:13,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:18:13,216 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:18:13,216 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:18:13,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-15 23:18:13,286 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/data/3c3476c7d/31fa814861324be9a0b864f4f837a84f/FLAG2afe3b5e6 [2019-11-15 23:18:13,783 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:18:13,784 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-15 23:18:13,791 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/data/3c3476c7d/31fa814861324be9a0b864f4f837a84f/FLAG2afe3b5e6 [2019-11-15 23:18:14,206 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/data/3c3476c7d/31fa814861324be9a0b864f4f837a84f [2019-11-15 23:18:14,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:18:14,212 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:18:14,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:18:14,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:18:14,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:18:14,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:18:14" (1/1) ... [2019-11-15 23:18:14,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f96aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:14, skipping insertion in model container [2019-11-15 23:18:14,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:18:14" (1/1) ... [2019-11-15 23:18:14,239 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:18:14,262 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:18:14,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:18:14,630 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:18:14,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:18:14,667 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:18:14,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:14 WrapperNode [2019-11-15 23:18:14,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:18:14,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:18:14,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:18:14,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:18:14,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:14" (1/1) ... [2019-11-15 23:18:14,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:14" (1/1) ... [2019-11-15 23:18:14,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:14" (1/1) ... [2019-11-15 23:18:14,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:14" (1/1) ... [2019-11-15 23:18:14,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:14" (1/1) ... [2019-11-15 23:18:14,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:14" (1/1) ... [2019-11-15 23:18:14,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:14" (1/1) ... [2019-11-15 23:18:14,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:18:14,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:18:14,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:18:14,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:18:14,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/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 [2019-11-15 23:18:14,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:18:14,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:18:14,778 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:18:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:18:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:18:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:18:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:18:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:18:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:18:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:18:15,231 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:18:15,231 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-15 23:18:15,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:18:15 BoogieIcfgContainer [2019-11-15 23:18:15,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:18:15,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:18:15,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:18:15,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:18:15,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:18:14" (1/3) ... [2019-11-15 23:18:15,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5326f180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:18:15, skipping insertion in model container [2019-11-15 23:18:15,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:18:14" (2/3) ... [2019-11-15 23:18:15,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5326f180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:18:15, skipping insertion in model container [2019-11-15 23:18:15,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:18:15" (3/3) ... [2019-11-15 23:18:15,239 INFO L109 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2019-11-15 23:18:15,249 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:18:15,256 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-11-15 23:18:15,268 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-11-15 23:18:15,287 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:18:15,287 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:18:15,287 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:18:15,287 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:18:15,288 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:18:15,288 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:18:15,288 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:18:15,288 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:18:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-11-15 23:18:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 23:18:15,314 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:15,315 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:15,317 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:15,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:15,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145205, now seen corresponding path program 1 times [2019-11-15 23:18:15,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:15,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237654039] [2019-11-15 23:18:15,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:15,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:15,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:15,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:15,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237654039] [2019-11-15 23:18:15,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:15,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:18:15,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886208686] [2019-11-15 23:18:15,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:18:15,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:15,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:18:15,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:18:15,583 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2019-11-15 23:18:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:15,784 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-15 23:18:15,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:18:15,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 23:18:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:15,795 INFO L225 Difference]: With dead ends: 57 [2019-11-15 23:18:15,796 INFO L226 Difference]: Without dead ends: 54 [2019-11-15 23:18:15,797 INFO L600 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 [2019-11-15 23:18:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-15 23:18:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-15 23:18:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-15 23:18:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-15 23:18:15,835 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 7 [2019-11-15 23:18:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:15,836 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-15 23:18:15,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:18:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-15 23:18:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 23:18:15,837 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:15,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:15,837 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:15,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145206, now seen corresponding path program 1 times [2019-11-15 23:18:15,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:15,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167082449] [2019-11-15 23:18:15,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:15,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:15,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:15,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167082449] [2019-11-15 23:18:15,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:15,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:18:15,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093060295] [2019-11-15 23:18:15,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:18:15,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:15,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:18:15,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:18:15,950 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2019-11-15 23:18:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:16,079 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-11-15 23:18:16,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:18:16,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 23:18:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:16,081 INFO L225 Difference]: With dead ends: 50 [2019-11-15 23:18:16,081 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 23:18:16,082 INFO L600 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 [2019-11-15 23:18:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 23:18:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-15 23:18:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 23:18:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-15 23:18:16,091 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 7 [2019-11-15 23:18:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:16,091 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-15 23:18:16,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:18:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-15 23:18:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 23:18:16,093 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:16,093 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:16,093 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:16,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:16,094 INFO L82 PathProgramCache]: Analyzing trace with hash -523138922, now seen corresponding path program 1 times [2019-11-15 23:18:16,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:16,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542230661] [2019-11-15 23:18:16,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:16,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542230661] [2019-11-15 23:18:16,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:16,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:18:16,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561956809] [2019-11-15 23:18:16,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:18:16,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:18:16,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:18:16,164 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2019-11-15 23:18:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:16,288 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-15 23:18:16,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:18:16,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-15 23:18:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:16,289 INFO L225 Difference]: With dead ends: 46 [2019-11-15 23:18:16,290 INFO L226 Difference]: Without dead ends: 46 [2019-11-15 23:18:16,290 INFO L600 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 [2019-11-15 23:18:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-15 23:18:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-15 23:18:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 23:18:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-11-15 23:18:16,296 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 8 [2019-11-15 23:18:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:16,297 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-11-15 23:18:16,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:18:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-11-15 23:18:16,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 23:18:16,297 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:16,298 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:16,298 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:16,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:16,298 INFO L82 PathProgramCache]: Analyzing trace with hash -523138921, now seen corresponding path program 1 times [2019-11-15 23:18:16,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:16,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756877022] [2019-11-15 23:18:16,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:16,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756877022] [2019-11-15 23:18:16,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:16,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:18:16,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542860059] [2019-11-15 23:18:16,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:18:16,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:16,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:18:16,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:18:16,365 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 4 states. [2019-11-15 23:18:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:16,470 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-15 23:18:16,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:18:16,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-15 23:18:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:16,472 INFO L225 Difference]: With dead ends: 42 [2019-11-15 23:18:16,472 INFO L226 Difference]: Without dead ends: 42 [2019-11-15 23:18:16,472 INFO L600 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 [2019-11-15 23:18:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-15 23:18:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-15 23:18:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 23:18:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-15 23:18:16,477 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2019-11-15 23:18:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:16,477 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-15 23:18:16,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:18:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-15 23:18:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 23:18:16,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:16,478 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:16,478 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:16,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:16,479 INFO L82 PathProgramCache]: Analyzing trace with hash 962562584, now seen corresponding path program 1 times [2019-11-15 23:18:16,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:16,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429019671] [2019-11-15 23:18:16,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:16,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429019671] [2019-11-15 23:18:16,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:16,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:18:16,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298740883] [2019-11-15 23:18:16,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:18:16,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:16,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:18:16,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:18:16,540 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2019-11-15 23:18:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:16,631 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-15 23:18:16,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:18:16,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-15 23:18:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:16,632 INFO L225 Difference]: With dead ends: 38 [2019-11-15 23:18:16,632 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 23:18:16,633 INFO L600 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 [2019-11-15 23:18:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 23:18:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-15 23:18:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 23:18:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-11-15 23:18:16,637 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 9 [2019-11-15 23:18:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:16,637 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-11-15 23:18:16,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:18:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-11-15 23:18:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 23:18:16,638 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:16,638 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:16,638 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash 962562585, now seen corresponding path program 1 times [2019-11-15 23:18:16,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:16,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654672837] [2019-11-15 23:18:16,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:16,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654672837] [2019-11-15 23:18:16,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:16,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:18:16,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093597351] [2019-11-15 23:18:16,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:18:16,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:16,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:18:16,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:18:16,700 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2019-11-15 23:18:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:16,775 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-11-15 23:18:16,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:18:16,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-15 23:18:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:16,776 INFO L225 Difference]: With dead ends: 34 [2019-11-15 23:18:16,777 INFO L226 Difference]: Without dead ends: 34 [2019-11-15 23:18:16,777 INFO L600 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 [2019-11-15 23:18:16,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-15 23:18:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-15 23:18:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 23:18:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-15 23:18:16,781 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 9 [2019-11-15 23:18:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:16,781 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-15 23:18:16,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:18:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-15 23:18:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:18:16,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:16,782 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:16,782 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:16,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:16,783 INFO L82 PathProgramCache]: Analyzing trace with hash -225330983, now seen corresponding path program 1 times [2019-11-15 23:18:16,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:16,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91050656] [2019-11-15 23:18:16,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:16,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91050656] [2019-11-15 23:18:16,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:16,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:18:16,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595834014] [2019-11-15 23:18:16,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:18:16,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:16,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:18:16,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:18:16,832 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2019-11-15 23:18:16,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:16,919 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-11-15 23:18:16,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:18:16,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 23:18:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:16,920 INFO L225 Difference]: With dead ends: 31 [2019-11-15 23:18:16,920 INFO L226 Difference]: Without dead ends: 31 [2019-11-15 23:18:16,921 INFO L600 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 [2019-11-15 23:18:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-15 23:18:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-15 23:18:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 23:18:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-11-15 23:18:16,925 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2019-11-15 23:18:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:16,926 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-15 23:18:16,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:18:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-11-15 23:18:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:18:16,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:16,927 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:16,927 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:16,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:16,928 INFO L82 PathProgramCache]: Analyzing trace with hash -225330982, now seen corresponding path program 1 times [2019-11-15 23:18:16,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:16,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241064337] [2019-11-15 23:18:16,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:16,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:16,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241064337] [2019-11-15 23:18:16,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:16,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:18:16,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050076163] [2019-11-15 23:18:16,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:18:16,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:16,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:18:17,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:18:17,000 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2019-11-15 23:18:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:17,068 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-11-15 23:18:17,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:18:17,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 23:18:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:17,070 INFO L225 Difference]: With dead ends: 28 [2019-11-15 23:18:17,071 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 23:18:17,071 INFO L600 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 [2019-11-15 23:18:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 23:18:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-15 23:18:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 23:18:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-15 23:18:17,075 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2019-11-15 23:18:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:17,075 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-15 23:18:17,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:18:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-15 23:18:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 23:18:17,076 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:17,076 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:17,076 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:17,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:17,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1860435007, now seen corresponding path program 1 times [2019-11-15 23:18:17,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:17,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192835518] [2019-11-15 23:18:17,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:17,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:17,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:17,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192835518] [2019-11-15 23:18:17,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:17,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:18:17,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784665977] [2019-11-15 23:18:17,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:18:17,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:17,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:18:17,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:18:17,150 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2019-11-15 23:18:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:17,260 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-11-15 23:18:17,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:18:17,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-15 23:18:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:17,261 INFO L225 Difference]: With dead ends: 43 [2019-11-15 23:18:17,261 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 23:18:17,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:18:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 23:18:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-11-15 23:18:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:18:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-15 23:18:17,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2019-11-15 23:18:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:17,265 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-15 23:18:17,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:18:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-15 23:18:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:18:17,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:17,266 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:17,267 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:17,267 INFO L82 PathProgramCache]: Analyzing trace with hash 988980839, now seen corresponding path program 1 times [2019-11-15 23:18:17,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:17,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053619959] [2019-11-15 23:18:17,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:17,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:17,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:17,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053619959] [2019-11-15 23:18:17,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817388556] [2019-11-15 23:18:17,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/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 [2019-11-15 23:18:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:17,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:18:17,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:17,551 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:17,551 INFO L375 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 27 treesize of output 31 [2019-11-15 23:18:17,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:17,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:17,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:17,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2019-11-15 23:18:17,584 INFO L375 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 [2019-11-15 23:18:17,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:17,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:17,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:17,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-15 23:18:17,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 23:18:17,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:17,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:17,616 INFO L496 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. [2019-11-15 23:18:17,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-15 23:18:17,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:18:17,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:17,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:17,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:17,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-15 23:18:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:17,667 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:18:17,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 23:18:17,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846679914] [2019-11-15 23:18:17,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:18:17,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:17,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:18:17,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:18:17,668 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2019-11-15 23:18:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:17,925 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-11-15 23:18:17,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:18:17,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-15 23:18:17,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:17,927 INFO L225 Difference]: With dead ends: 36 [2019-11-15 23:18:17,927 INFO L226 Difference]: Without dead ends: 36 [2019-11-15 23:18:17,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:18:17,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-15 23:18:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-11-15 23:18:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:18:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-15 23:18:17,930 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2019-11-15 23:18:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:17,931 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-15 23:18:17,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:18:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-15 23:18:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:18:17,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:17,932 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:18,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:18,141 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:18,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1875845268, now seen corresponding path program 1 times [2019-11-15 23:18:18,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:18,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112206190] [2019-11-15 23:18:18,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:18,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:18,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:18,444 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-15 23:18:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:18,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112206190] [2019-11-15 23:18:18,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:18:18,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:18:18,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361408343] [2019-11-15 23:18:18,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:18:18,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:18,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:18:18,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:18:18,701 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 10 states. [2019-11-15 23:18:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:19,269 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-11-15 23:18:19,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:18:19,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-15 23:18:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:19,271 INFO L225 Difference]: With dead ends: 44 [2019-11-15 23:18:19,271 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 23:18:19,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:18:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 23:18:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-11-15 23:18:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 23:18:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-15 23:18:19,275 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-11-15 23:18:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:19,276 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-15 23:18:19,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:18:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-15 23:18:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:18:19,277 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:19,277 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:19,277 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash -364567876, now seen corresponding path program 1 times [2019-11-15 23:18:19,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:19,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607046746] [2019-11-15 23:18:19,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:19,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:19,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:19,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607046746] [2019-11-15 23:18:19,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865819740] [2019-11-15 23:18:19,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/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 [2019-11-15 23:18:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:19,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 23:18:19,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:19,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-11-15 23:18:19,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:19,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:11 [2019-11-15 23:18:19,950 INFO L375 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 [2019-11-15 23:18:19,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:19,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:19,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-15 23:18:20,020 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:20,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-15 23:18:20,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:20,061 INFO L567 ElimStorePlain]: treesize reduction 12, result has 70.7 percent of original size [2019-11-15 23:18:20,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:20,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-11-15 23:18:20,294 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:20,295 INFO L375 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-15 23:18:20,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:20,328 INFO L567 ElimStorePlain]: treesize reduction 16, result has 61.9 percent of original size [2019-11-15 23:18:20,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:18:20,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2019-11-15 23:18:20,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:20,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-15 23:18:20,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:20,448 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-15 23:18:20,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:20,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:18:20,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:41 [2019-11-15 23:18:20,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:20,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:20,540 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:20,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2019-11-15 23:18:20,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:20,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-15 23:18:20,548 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:20,562 INFO L567 ElimStorePlain]: treesize reduction 21, result has 27.6 percent of original size [2019-11-15 23:18:20,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:20,562 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:3 [2019-11-15 23:18:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:20,566 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:18:20,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2019-11-15 23:18:20,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941985899] [2019-11-15 23:18:20,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:18:20,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:20,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:18:20,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:18:20,568 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 22 states. [2019-11-15 23:18:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:21,526 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-11-15 23:18:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:18:21,527 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2019-11-15 23:18:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:21,528 INFO L225 Difference]: With dead ends: 64 [2019-11-15 23:18:21,528 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 23:18:21,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 23:18:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 23:18:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2019-11-15 23:18:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 23:18:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-15 23:18:21,534 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 27 [2019-11-15 23:18:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:21,534 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-15 23:18:21,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:18:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-15 23:18:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:18:21,535 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:21,536 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:21,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:21,747 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:21,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:21,747 INFO L82 PathProgramCache]: Analyzing trace with hash -587061395, now seen corresponding path program 1 times [2019-11-15 23:18:21,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:21,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063744555] [2019-11-15 23:18:21,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:21,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:21,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:22,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063744555] [2019-11-15 23:18:22,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337868681] [2019-11-15 23:18:22,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:22,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 23:18:22,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:22,535 INFO L375 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 [2019-11-15 23:18:22,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:22,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:22,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:22,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 23:18:22,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:22,590 INFO L375 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 19 treesize of output 34 [2019-11-15 23:18:22,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:22,609 INFO L567 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2019-11-15 23:18:22,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:18:22,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-15 23:18:22,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:22,659 INFO L375 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 19 treesize of output 34 [2019-11-15 23:18:22,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:22,683 INFO L567 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2019-11-15 23:18:22,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:22,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-15 23:18:22,744 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:22,744 INFO L375 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 26 treesize of output 68 [2019-11-15 23:18:22,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:22,789 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-11-15 23:18:22,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:22,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:39 [2019-11-15 23:18:22,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:23,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:18:23,074 INFO L392 ElimStorePlain]: Different costs {3=[v_prenex_2], 5=[|v_#memory_int_39|]} [2019-11-15 23:18:23,102 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:23,102 INFO L375 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 2 case distinctions, treesize of input 29 treesize of output 48 [2019-11-15 23:18:23,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:23,174 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2019-11-15 23:18:23,207 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:23,207 INFO L375 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 2 case distinctions, treesize of input 29 treesize of output 48 [2019-11-15 23:18:23,208 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:23,246 INFO L567 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-11-15 23:18:23,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 23:18:23,247 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-11-15 23:18:23,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:18:23,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:23,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:23,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:23,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-11-15 23:18:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:23,372 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:18:23,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-11-15 23:18:23,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165657559] [2019-11-15 23:18:23,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 23:18:23,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 23:18:23,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-11-15 23:18:23,374 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 24 states. [2019-11-15 23:18:24,296 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-11-15 23:18:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:24,908 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-15 23:18:24,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:18:24,909 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-11-15 23:18:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:24,909 INFO L225 Difference]: With dead ends: 52 [2019-11-15 23:18:24,909 INFO L226 Difference]: Without dead ends: 52 [2019-11-15 23:18:24,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 23:18:24,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-15 23:18:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-11-15 23:18:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 23:18:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-11-15 23:18:24,915 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 30 [2019-11-15 23:18:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:24,915 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-11-15 23:18:24,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 23:18:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-11-15 23:18:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:18:24,917 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:24,917 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:25,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:25,118 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:25,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:25,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1006543714, now seen corresponding path program 1 times [2019-11-15 23:18:25,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:25,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804630663] [2019-11-15 23:18:25,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:25,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:25,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:18:25,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804630663] [2019-11-15 23:18:25,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851961285] [2019-11-15 23:18:25,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:25,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:18:25,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:25,377 INFO L375 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 [2019-11-15 23:18:25,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:25,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:25,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:25,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-15 23:18:25,441 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:25,441 INFO L375 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 19 treesize of output 34 [2019-11-15 23:18:25,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:25,467 INFO L567 ElimStorePlain]: treesize reduction 12, result has 67.6 percent of original size [2019-11-15 23:18:25,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:25,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:25 [2019-11-15 23:18:25,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 23:18:25,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:25,541 INFO L567 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-11-15 23:18:25,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:25,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2019-11-15 23:18:25,563 INFO L375 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 [2019-11-15 23:18:25,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:18:25,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:18:25,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:18:25,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 23:18:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:18:25,580 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:18:25,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-15 23:18:25,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106726065] [2019-11-15 23:18:25,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:18:25,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:25,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:18:25,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:18:25,582 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 15 states. [2019-11-15 23:18:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:25,946 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-11-15 23:18:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:18:25,947 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-11-15 23:18:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:25,947 INFO L225 Difference]: With dead ends: 62 [2019-11-15 23:18:25,947 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 23:18:25,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:18:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 23:18:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2019-11-15 23:18:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 23:18:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-15 23:18:25,953 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 39 [2019-11-15 23:18:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:25,953 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-15 23:18:25,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:18:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-15 23:18:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:18:25,955 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:18:25,955 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:18:26,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:26,159 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 23:18:26,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:18:26,159 INFO L82 PathProgramCache]: Analyzing trace with hash 210942700, now seen corresponding path program 2 times [2019-11-15 23:18:26,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:18:26,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131712287] [2019-11-15 23:18:26,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:26,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:18:26,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:18:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:18:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 23:18:26,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131712287] [2019-11-15 23:18:26,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792680130] [2019-11-15 23:18:26,500 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:26,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 23:18:26,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:18:26,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:18:26,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:18:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:18:26,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:18:26,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-11-15 23:18:26,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032378728] [2019-11-15 23:18:26,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:18:26,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:18:26,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:18:26,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:18:26,692 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2019-11-15 23:18:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:18:26,851 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-11-15 23:18:26,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:18:26,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-15 23:18:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:18:26,853 INFO L225 Difference]: With dead ends: 49 [2019-11-15 23:18:26,853 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:18:26,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:18:26,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:18:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:18:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:18:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:18:26,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2019-11-15 23:18:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:18:26,854 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:18:26,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:18:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:18:26,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:18:27,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:18:27,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:18:27 BoogieIcfgContainer [2019-11-15 23:18:27,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:18:27,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:18:27,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:18:27,060 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:18:27,060 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:18:15" (3/4) ... [2019-11-15 23:18:27,062 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:18:27,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 23:18:27,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 23:18:27,072 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-15 23:18:27,072 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 23:18:27,073 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:18:27,073 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:18:27,113 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_910b3f39-6b2b-4ec0-ad48-5581587d4e01/bin/uautomizer/witness.graphml [2019-11-15 23:18:27,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:18:27,114 INFO L168 Benchmark]: Toolchain (without parser) took 12903.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.7 MB). Free memory was 951.4 MB in the beginning and 985.2 MB in the end (delta: -33.8 MB). Peak memory consumption was 317.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:18:27,115 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:18:27,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -225.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:18:27,115 INFO L168 Benchmark]: Boogie Preprocessor took 41.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:18:27,116 INFO L168 Benchmark]: RCFGBuilder took 521.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:18:27,116 INFO L168 Benchmark]: TraceAbstraction took 11825.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 164.1 MB). Free memory was 1.2 GB in the beginning and 988.1 MB in the end (delta: 162.5 MB). Peak memory consumption was 326.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:18:27,117 INFO L168 Benchmark]: Witness Printer took 53.54 ms. Allocated memory is still 1.4 GB. Free memory was 988.1 MB in the beginning and 985.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:18:27,118 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 448.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -225.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 521.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11825.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 164.1 MB). Free memory was 1.2 GB in the beginning and 988.1 MB in the end (delta: 162.5 MB). Peak memory consumption was 326.6 MB. Max. memory is 11.5 GB. * Witness Printer took 53.54 ms. Allocated memory is still 1.4 GB. Free memory was 988.1 MB in the beginning and 985.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 61 locations, 31 error locations. Result: SAFE, OverallTime: 11.7s, OverallIterations: 15, TraceHistogramMax: 5, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 245 SDtfs, 701 SDslu, 493 SDs, 0 SdLazy, 1731 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 163 SyntacticMatches, 12 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred 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.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 69 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 422 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 402 ConstructedInterpolants, 11 QuantifiedInterpolants, 229008 SizeOfPredicates, 43 NumberOfNonLiveVariables, 744 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 110/152 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...