./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:06:44,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:06:44,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:06:44,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:06:44,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:06:44,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:06:44,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:06:44,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:06:44,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:06:44,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:06:44,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:06:44,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:06:44,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:06:44,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:06:44,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:06:44,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:06:44,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:06:44,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:06:44,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:06:44,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:06:44,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:06:44,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:06:44,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:06:44,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:06:44,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:06:44,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:06:44,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:06:44,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:06:44,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:06:44,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:06:44,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:06:44,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:06:44,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:06:44,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:06:44,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:06:44,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:06:44,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:06:44,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:06:44,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:06:44,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:06:44,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:06:44,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 22:06:44,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:06:44,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:06:44,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:06:44,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:06:44,451 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:06:44,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:06:44,452 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:06:44,452 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:06:44,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:06:44,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:06:44,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:06:44,455 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:06:44,455 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:06:44,455 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:06:44,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:06:44,456 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:06:44,456 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:06:44,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:06:44,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:06:44,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:06:44,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:06:44,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:06:44,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:06:44,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:06:44,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:06:44,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:06:44,460 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_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 [2019-11-15 22:06:44,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:06:44,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:06:44,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:06:44,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:06:44,537 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:06:44,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-11-15 22:06:44,611 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/data/e0f21b394/25755f60f6614ce38ec6a69931e3f782/FLAGa9ff618fc [2019-11-15 22:06:45,155 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:06:45,156 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-11-15 22:06:45,183 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/data/e0f21b394/25755f60f6614ce38ec6a69931e3f782/FLAGa9ff618fc [2019-11-15 22:06:45,388 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/data/e0f21b394/25755f60f6614ce38ec6a69931e3f782 [2019-11-15 22:06:45,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:06:45,392 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:06:45,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:06:45,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:06:45,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:06:45,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:06:45" (1/1) ... [2019-11-15 22:06:45,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156dc04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:06:45, skipping insertion in model container [2019-11-15 22:06:45,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:06:45" (1/1) ... [2019-11-15 22:06:45,413 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:06:45,454 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:06:45,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:06:45,926 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:06:46,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:06:46,063 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:06:46,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:06:46 WrapperNode [2019-11-15 22:06:46,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:06:46,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:06:46,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:06:46,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:06:46,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:06:46" (1/1) ... [2019-11-15 22:06:46,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:06:46" (1/1) ... [2019-11-15 22:06:46,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:06:46" (1/1) ... [2019-11-15 22:06:46,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:06:46" (1/1) ... [2019-11-15 22:06:46,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:06:46" (1/1) ... [2019-11-15 22:06:46,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:06:46" (1/1) ... [2019-11-15 22:06:46,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:06:46" (1/1) ... [2019-11-15 22:06:46,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:06:46,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:06:46,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:06:46,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:06:46,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:06:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/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 22:06:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:06:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:06:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:06:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:06:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 22:06:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 22:06:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 22:06:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2019-11-15 22:06:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:06:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:06:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:06:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:06:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:06:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:06:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:06:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:06:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:06:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:06:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:06:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:06:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:06:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:06:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:06:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:06:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:06:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:06:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:06:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 22:06:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 22:06:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 22:06:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:06:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:06:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:06:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:06:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:06:46,212 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:06:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:06:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:06:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:06:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:06:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:06:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:06:46,213 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:06:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:06:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:06:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:06:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:06:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:06:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:06:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:06:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:06:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:06:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:06:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:06:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:06:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:06:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:06:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:06:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:06:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:06:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:06:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:06:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:06:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:06:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:06:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:06:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:06:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:06:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:06:46,220 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:06:46,220 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:06:46,221 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:06:46,221 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:06:46,221 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:06:46,222 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:06:46,222 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:06:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:06:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:06:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:06:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:06:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:06:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:06:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:06:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:06:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:06:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:06:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:06:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:06:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:06:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:06:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:06:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:06:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:06:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:06:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:06:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:06:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:06:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:06:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:06:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:06:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:06:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:06:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:06:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:06:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:06:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:06:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:06:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:06:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:06:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:06:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:06:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:06:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:06:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:06:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:06:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:06:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:06:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-15 22:06:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2019-11-15 22:06:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:06:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:06:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:06:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:06:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:06:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:06:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:06:46,893 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:06:46,894 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-15 22:06:46,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:06:46 BoogieIcfgContainer [2019-11-15 22:06:46,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:06:46,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:06:46,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:06:46,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:06:46,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:06:45" (1/3) ... [2019-11-15 22:06:46,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4a5dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:06:46, skipping insertion in model container [2019-11-15 22:06:46,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:06:46" (2/3) ... [2019-11-15 22:06:46,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4a5dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:06:46, skipping insertion in model container [2019-11-15 22:06:46,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:06:46" (3/3) ... [2019-11-15 22:06:46,907 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca-2.i [2019-11-15 22:06:46,922 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:06:46,934 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-15 22:06:46,954 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-15 22:06:46,975 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:06:46,975 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:06:46,975 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:06:46,975 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:06:46,976 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:06:46,976 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:06:46,976 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:06:46,976 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:06:46,993 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-11-15 22:06:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:06:47,004 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:47,005 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:47,006 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:47,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1915750614, now seen corresponding path program 1 times [2019-11-15 22:06:47,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:47,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943651490] [2019-11-15 22:06:47,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:47,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:47,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:47,275 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 22:06:47,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943651490] [2019-11-15 22:06:47,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:47,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:06:47,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125285573] [2019-11-15 22:06:47,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:06:47,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:47,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:06:47,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:06:47,298 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2019-11-15 22:06:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:47,545 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2019-11-15 22:06:47,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:06:47,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-15 22:06:47,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:47,559 INFO L225 Difference]: With dead ends: 72 [2019-11-15 22:06:47,560 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 22:06:47,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:06:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 22:06:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2019-11-15 22:06:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-15 22:06:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-15 22:06:47,619 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 11 [2019-11-15 22:06:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:47,620 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-15 22:06:47,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:06:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-15 22:06:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:06:47,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:47,623 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:47,623 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:47,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:47,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1917597656, now seen corresponding path program 1 times [2019-11-15 22:06:47,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:47,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704794353] [2019-11-15 22:06:47,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:47,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:47,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:47,791 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 22:06:47,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704794353] [2019-11-15 22:06:47,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:47,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:06:47,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922820985] [2019-11-15 22:06:47,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:06:47,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:47,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:06:47,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:06:47,795 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2019-11-15 22:06:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:48,034 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-11-15 22:06:48,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:06:48,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-15 22:06:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:48,037 INFO L225 Difference]: With dead ends: 73 [2019-11-15 22:06:48,037 INFO L226 Difference]: Without dead ends: 73 [2019-11-15 22:06:48,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 22:06:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-15 22:06:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2019-11-15 22:06:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 22:06:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-11-15 22:06:48,046 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 11 [2019-11-15 22:06:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:48,047 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-11-15 22:06:48,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:06:48,047 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-11-15 22:06:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:06:48,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:48,048 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:48,049 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:48,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1917597655, now seen corresponding path program 1 times [2019-11-15 22:06:48,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:48,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112764486] [2019-11-15 22:06:48,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:48,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:48,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:48,112 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 22:06:48,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112764486] [2019-11-15 22:06:48,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:48,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:06:48,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736625089] [2019-11-15 22:06:48,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:06:48,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:48,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:06:48,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:06:48,118 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2019-11-15 22:06:48,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:48,250 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-11-15 22:06:48,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:06:48,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 22:06:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:48,252 INFO L225 Difference]: With dead ends: 51 [2019-11-15 22:06:48,253 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 22:06:48,253 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 22:06:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 22:06:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-15 22:06:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-15 22:06:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2019-11-15 22:06:48,263 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 11 [2019-11-15 22:06:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:48,264 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2019-11-15 22:06:48,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:06:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2019-11-15 22:06:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:06:48,265 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:48,266 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:48,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:48,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1504681331, now seen corresponding path program 1 times [2019-11-15 22:06:48,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:48,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191889866] [2019-11-15 22:06:48,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:48,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:48,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:48,354 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 22:06:48,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191889866] [2019-11-15 22:06:48,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:48,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:06:48,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246553460] [2019-11-15 22:06:48,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:06:48,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:48,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:06:48,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:06:48,365 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 5 states. [2019-11-15 22:06:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:48,556 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-11-15 22:06:48,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:06:48,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-15 22:06:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:48,559 INFO L225 Difference]: With dead ends: 50 [2019-11-15 22:06:48,559 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 22:06:48,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:06:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 22:06:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-15 22:06:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 22:06:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-11-15 22:06:48,569 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2019-11-15 22:06:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:48,569 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-11-15 22:06:48,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:06:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-11-15 22:06:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:06:48,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:48,571 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:48,572 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:48,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:48,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1504681279, now seen corresponding path program 1 times [2019-11-15 22:06:48,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:48,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395936513] [2019-11-15 22:06:48,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:48,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:48,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:48,678 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 22:06:48,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395936513] [2019-11-15 22:06:48,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:48,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:06:48,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284210040] [2019-11-15 22:06:48,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:06:48,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:48,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:06:48,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:06:48,680 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 5 states. [2019-11-15 22:06:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:48,851 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-15 22:06:48,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:06:48,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-15 22:06:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:48,853 INFO L225 Difference]: With dead ends: 70 [2019-11-15 22:06:48,853 INFO L226 Difference]: Without dead ends: 70 [2019-11-15 22:06:48,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:06:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-15 22:06:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2019-11-15 22:06:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 22:06:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-11-15 22:06:48,870 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 13 [2019-11-15 22:06:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:48,870 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-11-15 22:06:48,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:06:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-11-15 22:06:48,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:06:48,872 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:48,872 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:48,872 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:48,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:48,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1447422977, now seen corresponding path program 1 times [2019-11-15 22:06:48,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:48,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764123892] [2019-11-15 22:06:48,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:48,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:48,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:48,977 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 22:06:48,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764123892] [2019-11-15 22:06:48,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:48,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:06:48,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109246176] [2019-11-15 22:06:48,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:06:48,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:48,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:06:48,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:06:48,981 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 4 states. [2019-11-15 22:06:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:49,099 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2019-11-15 22:06:49,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:06:49,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-15 22:06:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:49,100 INFO L225 Difference]: With dead ends: 59 [2019-11-15 22:06:49,100 INFO L226 Difference]: Without dead ends: 59 [2019-11-15 22:06:49,101 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 22:06:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-15 22:06:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-15 22:06:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-15 22:06:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2019-11-15 22:06:49,107 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 13 [2019-11-15 22:06:49,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:49,107 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2019-11-15 22:06:49,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:06:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2019-11-15 22:06:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:06:49,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:49,109 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:49,109 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:49,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:49,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1447422976, now seen corresponding path program 1 times [2019-11-15 22:06:49,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:49,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392863470] [2019-11-15 22:06:49,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:49,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:49,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:49,250 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 22:06:49,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392863470] [2019-11-15 22:06:49,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:49,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:06:49,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687664580] [2019-11-15 22:06:49,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:06:49,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:49,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:06:49,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:06:49,253 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 6 states. [2019-11-15 22:06:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:49,491 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2019-11-15 22:06:49,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:06:49,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-15 22:06:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:49,493 INFO L225 Difference]: With dead ends: 70 [2019-11-15 22:06:49,493 INFO L226 Difference]: Without dead ends: 70 [2019-11-15 22:06:49,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:06:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-15 22:06:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2019-11-15 22:06:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 22:06:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-15 22:06:49,499 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 13 [2019-11-15 22:06:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:49,499 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-15 22:06:49,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:06:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-15 22:06:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:06:49,500 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:49,500 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:49,505 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:49,506 INFO L82 PathProgramCache]: Analyzing trace with hash 599518995, now seen corresponding path program 1 times [2019-11-15 22:06:49,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:49,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313416552] [2019-11-15 22:06:49,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:49,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:49,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:49,638 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 22:06:49,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313416552] [2019-11-15 22:06:49,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:49,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:06:49,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48153483] [2019-11-15 22:06:49,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:06:49,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:49,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:06:49,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:06:49,640 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 5 states. [2019-11-15 22:06:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:49,749 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-11-15 22:06:49,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:06:49,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-15 22:06:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:49,755 INFO L225 Difference]: With dead ends: 68 [2019-11-15 22:06:49,755 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 22:06:49,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:06:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 22:06:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-11-15 22:06:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 22:06:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-11-15 22:06:49,773 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 14 [2019-11-15 22:06:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:49,774 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-11-15 22:06:49,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:06:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2019-11-15 22:06:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:06:49,777 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:49,777 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:49,777 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:49,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1920440939, now seen corresponding path program 1 times [2019-11-15 22:06:49,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:49,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417522862] [2019-11-15 22:06:49,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:49,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:49,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:49,885 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 22:06:49,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417522862] [2019-11-15 22:06:49,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:49,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:06:49,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592227597] [2019-11-15 22:06:49,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:06:49,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:49,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:06:49,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:06:49,887 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2019-11-15 22:06:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:50,009 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-11-15 22:06:50,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:06:50,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-15 22:06:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:50,010 INFO L225 Difference]: With dead ends: 62 [2019-11-15 22:06:50,011 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 22:06:50,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:06:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 22:06:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-15 22:06:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 22:06:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2019-11-15 22:06:50,019 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 14 [2019-11-15 22:06:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:50,019 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2019-11-15 22:06:50,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:06:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2019-11-15 22:06:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:06:50,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:50,021 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:50,022 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2133845019, now seen corresponding path program 1 times [2019-11-15 22:06:50,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:50,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206477890] [2019-11-15 22:06:50,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:50,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:50,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:06:50,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206477890] [2019-11-15 22:06:50,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313195421] [2019-11-15 22:06:50,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/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 22:06:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:50,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:06:50,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:50,357 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_18|], 1=[|v_#valid_27|]} [2019-11-15 22:06:50,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:06:50,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-15 22:06:50,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:50,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:50,412 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 10 treesize of output 8 [2019-11-15 22:06:50,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:50,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:50,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:50,424 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-15 22:06:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:06:50,445 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:50,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-15 22:06:50,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123519749] [2019-11-15 22:06:50,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:06:50,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:50,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:06:50,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:06:50,447 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 7 states. [2019-11-15 22:06:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:50,674 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-11-15 22:06:50,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:06:50,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 22:06:50,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:50,675 INFO L225 Difference]: With dead ends: 79 [2019-11-15 22:06:50,675 INFO L226 Difference]: Without dead ends: 79 [2019-11-15 22:06:50,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:06:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-15 22:06:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2019-11-15 22:06:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-15 22:06:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-15 22:06:50,681 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 15 [2019-11-15 22:06:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:50,682 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-15 22:06:50,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:06:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-15 22:06:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:06:50,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:50,683 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:50,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:50,886 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:50,886 INFO L82 PathProgramCache]: Analyzing trace with hash -145961679, now seen corresponding path program 1 times [2019-11-15 22:06:50,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:50,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780705199] [2019-11-15 22:06:50,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:50,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:50,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:50,976 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 22:06:50,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780705199] [2019-11-15 22:06:50,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:50,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:06:50,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250880579] [2019-11-15 22:06:50,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:06:50,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:50,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:06:50,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:06:50,978 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 7 states. [2019-11-15 22:06:51,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:51,165 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-11-15 22:06:51,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:06:51,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-15 22:06:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:51,166 INFO L225 Difference]: With dead ends: 54 [2019-11-15 22:06:51,167 INFO L226 Difference]: Without dead ends: 54 [2019-11-15 22:06:51,167 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:06:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-15 22:06:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-15 22:06:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-15 22:06:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-11-15 22:06:51,172 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 18 [2019-11-15 22:06:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:51,172 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-11-15 22:06:51,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:06:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2019-11-15 22:06:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:06:51,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:51,174 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:51,174 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:51,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:51,175 INFO L82 PathProgramCache]: Analyzing trace with hash -145961678, now seen corresponding path program 1 times [2019-11-15 22:06:51,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:51,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711837524] [2019-11-15 22:06:51,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:51,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:51,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:51,287 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 22:06:51,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711837524] [2019-11-15 22:06:51,287 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:51,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:06:51,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94075773] [2019-11-15 22:06:51,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:06:51,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:51,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:06:51,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:06:51,289 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 9 states. [2019-11-15 22:06:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:51,602 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-11-15 22:06:51,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:06:51,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-15 22:06:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:51,604 INFO L225 Difference]: With dead ends: 57 [2019-11-15 22:06:51,604 INFO L226 Difference]: Without dead ends: 57 [2019-11-15 22:06:51,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:06:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-15 22:06:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-15 22:06:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-15 22:06:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-11-15 22:06:51,608 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 18 [2019-11-15 22:06:51,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:51,608 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-11-15 22:06:51,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:06:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2019-11-15 22:06:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 22:06:51,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:51,609 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:51,610 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:51,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:51,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1452007619, now seen corresponding path program 1 times [2019-11-15 22:06:51,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:51,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825175067] [2019-11-15 22:06:51,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:51,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:51,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:06:51,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825175067] [2019-11-15 22:06:51,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691685887] [2019-11-15 22:06:51,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/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 22:06:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:51,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:06:51,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:51,885 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:51,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-15 22:06:51,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:51,925 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-15 22:06:51,926 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 22:06:51,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-15 22:06:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:06:51,951 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:51,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-15 22:06:51,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351272653] [2019-11-15 22:06:51,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:06:51,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:51,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:06:51,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:06:51,953 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 7 states. [2019-11-15 22:06:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:52,126 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2019-11-15 22:06:52,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:06:52,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-15 22:06:52,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:52,128 INFO L225 Difference]: With dead ends: 63 [2019-11-15 22:06:52,128 INFO L226 Difference]: Without dead ends: 63 [2019-11-15 22:06:52,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:06:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-15 22:06:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2019-11-15 22:06:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 22:06:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-11-15 22:06:52,132 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 17 [2019-11-15 22:06:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:52,132 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-11-15 22:06:52,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:06:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-11-15 22:06:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:06:52,145 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:52,146 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:52,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:52,350 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:52,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:52,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1837428737, now seen corresponding path program 1 times [2019-11-15 22:06:52,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:52,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933101311] [2019-11-15 22:06:52,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:52,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:52,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:52,420 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 22:06:52,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933101311] [2019-11-15 22:06:52,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:52,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:06:52,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488427607] [2019-11-15 22:06:52,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:06:52,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:52,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:06:52,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:06:52,422 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2019-11-15 22:06:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:52,651 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-11-15 22:06:52,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:06:52,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-15 22:06:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:52,652 INFO L225 Difference]: With dead ends: 53 [2019-11-15 22:06:52,652 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 22:06:52,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:06:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 22:06:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-11-15 22:06:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-15 22:06:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-11-15 22:06:52,656 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 21 [2019-11-15 22:06:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:52,656 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-11-15 22:06:52,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:06:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-11-15 22:06:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:06:52,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:52,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:52,658 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:52,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1837428736, now seen corresponding path program 1 times [2019-11-15 22:06:52,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:52,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752986069] [2019-11-15 22:06:52,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:52,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:52,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:52,816 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 22:06:52,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752986069] [2019-11-15 22:06:52,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:52,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:06:52,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896986699] [2019-11-15 22:06:52,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:06:52,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:52,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:06:52,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:06:52,818 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 10 states. [2019-11-15 22:06:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:53,113 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-11-15 22:06:53,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:06:53,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-15 22:06:53,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:53,114 INFO L225 Difference]: With dead ends: 56 [2019-11-15 22:06:53,115 INFO L226 Difference]: Without dead ends: 56 [2019-11-15 22:06:53,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:06:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-15 22:06:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-11-15 22:06:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-15 22:06:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2019-11-15 22:06:53,118 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 21 [2019-11-15 22:06:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:53,118 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2019-11-15 22:06:53,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:06:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2019-11-15 22:06:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:06:53,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:53,120 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, 1, 1, 1, 1] [2019-11-15 22:06:53,120 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:53,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash 291331133, now seen corresponding path program 1 times [2019-11-15 22:06:53,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:53,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803964742] [2019-11-15 22:06:53,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:53,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:53,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:53,329 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 22:06:53,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803964742] [2019-11-15 22:06:53,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:53,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 22:06:53,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712888786] [2019-11-15 22:06:53,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:06:53,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:53,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:06:53,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:06:53,332 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 12 states. [2019-11-15 22:06:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:53,846 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2019-11-15 22:06:53,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:06:53,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-15 22:06:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:53,847 INFO L225 Difference]: With dead ends: 84 [2019-11-15 22:06:53,847 INFO L226 Difference]: Without dead ends: 84 [2019-11-15 22:06:53,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:06:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-15 22:06:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2019-11-15 22:06:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-15 22:06:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2019-11-15 22:06:53,851 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 26 [2019-11-15 22:06:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:53,852 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2019-11-15 22:06:53,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:06:53,852 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2019-11-15 22:06:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:06:53,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:53,853 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, 1, 1, 1, 1] [2019-11-15 22:06:53,853 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:53,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:53,854 INFO L82 PathProgramCache]: Analyzing trace with hash 291333311, now seen corresponding path program 1 times [2019-11-15 22:06:53,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:53,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058131608] [2019-11-15 22:06:53,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:53,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:53,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:54,073 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 22:06:54,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058131608] [2019-11-15 22:06:54,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:54,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 22:06:54,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491518773] [2019-11-15 22:06:54,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:06:54,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:54,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:06:54,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:06:54,075 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 12 states. [2019-11-15 22:06:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:54,519 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-15 22:06:54,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:06:54,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-15 22:06:54,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:54,522 INFO L225 Difference]: With dead ends: 109 [2019-11-15 22:06:54,522 INFO L226 Difference]: Without dead ends: 109 [2019-11-15 22:06:54,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:06:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-15 22:06:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-11-15 22:06:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 22:06:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2019-11-15 22:06:54,527 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 26 [2019-11-15 22:06:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:54,528 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2019-11-15 22:06:54,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:06:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2019-11-15 22:06:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:06:54,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:54,529 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, 1, 1, 1, 1] [2019-11-15 22:06:54,529 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1397610431, now seen corresponding path program 1 times [2019-11-15 22:06:54,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:54,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894658410] [2019-11-15 22:06:54,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:54,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:54,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:54,725 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 22:06:54,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894658410] [2019-11-15 22:06:54,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:54,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 22:06:54,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507219479] [2019-11-15 22:06:54,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:06:54,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:54,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:06:54,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:06:54,727 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 14 states. [2019-11-15 22:06:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:55,333 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-11-15 22:06:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:06:55,333 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-11-15 22:06:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:55,335 INFO L225 Difference]: With dead ends: 129 [2019-11-15 22:06:55,335 INFO L226 Difference]: Without dead ends: 129 [2019-11-15 22:06:55,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:06:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-15 22:06:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 92. [2019-11-15 22:06:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 22:06:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2019-11-15 22:06:55,341 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 26 [2019-11-15 22:06:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:55,341 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2019-11-15 22:06:55,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:06:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2019-11-15 22:06:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:06:55,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:55,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:55,343 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash 746415946, now seen corresponding path program 1 times [2019-11-15 22:06:55,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:55,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292248418] [2019-11-15 22:06:55,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:55,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:55,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:55,461 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 22:06:55,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292248418] [2019-11-15 22:06:55,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:55,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:06:55,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56788704] [2019-11-15 22:06:55,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:06:55,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:55,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:06:55,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:06:55,468 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 5 states. [2019-11-15 22:06:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:55,558 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-11-15 22:06:55,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:06:55,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-15 22:06:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:55,560 INFO L225 Difference]: With dead ends: 91 [2019-11-15 22:06:55,560 INFO L226 Difference]: Without dead ends: 60 [2019-11-15 22:06:55,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:06:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-15 22:06:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-15 22:06:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 22:06:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-11-15 22:06:55,563 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 28 [2019-11-15 22:06:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:55,563 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-11-15 22:06:55,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:06:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-11-15 22:06:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:06:55,564 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:55,564 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:55,565 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:55,570 INFO L82 PathProgramCache]: Analyzing trace with hash -467898274, now seen corresponding path program 1 times [2019-11-15 22:06:55,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:55,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484400125] [2019-11-15 22:06:55,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:55,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:55,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:06:55,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484400125] [2019-11-15 22:06:55,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575840695] [2019-11-15 22:06:55,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/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 22:06:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:55,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 22:06:55,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:06:56,158 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:56,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2019-11-15 22:06:56,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024216917] [2019-11-15 22:06:56,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 22:06:56,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:56,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 22:06:56,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-15 22:06:56,160 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 20 states. [2019-11-15 22:06:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:56,908 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2019-11-15 22:06:56,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:06:56,908 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-11-15 22:06:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:56,909 INFO L225 Difference]: With dead ends: 78 [2019-11-15 22:06:56,909 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 22:06:56,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:06:56,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 22:06:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2019-11-15 22:06:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-15 22:06:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-11-15 22:06:56,912 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 30 [2019-11-15 22:06:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:56,913 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-11-15 22:06:56,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 22:06:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-11-15 22:06:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:06:56,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:56,914 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:57,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:57,114 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:57,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:57,115 INFO L82 PathProgramCache]: Analyzing trace with hash -601913958, now seen corresponding path program 1 times [2019-11-15 22:06:57,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:57,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892153558] [2019-11-15 22:06:57,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:57,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:57,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:06:57,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892153558] [2019-11-15 22:06:57,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884043626] [2019-11-15 22:06:57,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/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 22:06:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:57,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 22:06:57,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:57,869 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 10 treesize of output 8 [2019-11-15 22:06:57,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:57,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:57,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:57,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-15 22:06:57,982 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 14 treesize of output 10 [2019-11-15 22:06:57,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:57,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:58,000 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 22:06:58,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-15 22:06:58,073 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 25 treesize of output 24 [2019-11-15 22:06:58,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:58,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:58,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 22:06:58,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-11-15 22:06:58,356 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:06:58,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 22:06:58,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:58,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:58,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:58,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:47, output treesize:3 [2019-11-15 22:06:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:58,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:06:58,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 28 [2019-11-15 22:06:58,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97832158] [2019-11-15 22:06:58,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:06:58,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:58,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:06:58,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:06:58,476 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 13 states. [2019-11-15 22:06:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:59,117 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2019-11-15 22:06:59,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:06:59,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-11-15 22:06:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:59,118 INFO L225 Difference]: With dead ends: 100 [2019-11-15 22:06:59,119 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 22:06:59,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=1139, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:06:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 22:06:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 71. [2019-11-15 22:06:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 22:06:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2019-11-15 22:06:59,123 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 30 [2019-11-15 22:06:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:59,123 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2019-11-15 22:06:59,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:06:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2019-11-15 22:06:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:06:59,124 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:59,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:59,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:59,325 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:06:59,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:59,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1610718345, now seen corresponding path program 1 times [2019-11-15 22:06:59,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:59,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475728418] [2019-11-15 22:06:59,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:59,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:59,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:59,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475728418] [2019-11-15 22:06:59,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523220287] [2019-11-15 22:06:59,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/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 22:06:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:59,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 22:06:59,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:59,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:59,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-15 22:06:59,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690609018] [2019-11-15 22:06:59,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:06:59,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:59,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:06:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:06:59,730 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 18 states. [2019-11-15 22:07:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:00,349 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-11-15 22:07:00,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:07:00,351 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-11-15 22:07:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:00,352 INFO L225 Difference]: With dead ends: 89 [2019-11-15 22:07:00,352 INFO L226 Difference]: Without dead ends: 89 [2019-11-15 22:07:00,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:07:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-15 22:07:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-11-15 22:07:00,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-15 22:07:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2019-11-15 22:07:00,357 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 34 [2019-11-15 22:07:00,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:00,357 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2019-11-15 22:07:00,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:07:00,357 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2019-11-15 22:07:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:07:00,358 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:00,358 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:00,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:00,563 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:07:00,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash 234852129, now seen corresponding path program 2 times [2019-11-15 22:07:00,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:00,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080897058] [2019-11-15 22:07:00,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:00,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:00,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:01,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080897058] [2019-11-15 22:07:01,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851472639] [2019-11-15 22:07:01,136 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:01,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:07:01,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:07:01,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 22:07:01,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:01,387 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 14 treesize of output 10 [2019-11-15 22:07:01,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:01,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:01,402 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 22:07:01,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-15 22:07:01,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:01,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-11-15 22:07:01,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:07:01,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:01,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:01,793 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 22:07:01,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:39 [2019-11-15 22:07:01,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:01,994 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:01,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 [2019-11-15 22:07:01,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343639467] [2019-11-15 22:07:01,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 22:07:01,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:01,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 22:07:01,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 22:07:01,996 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 33 states. [2019-11-15 22:07:04,273 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-15 22:07:04,421 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-15 22:07:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:04,749 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2019-11-15 22:07:04,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 22:07:04,750 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 35 [2019-11-15 22:07:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:04,751 INFO L225 Difference]: With dead ends: 151 [2019-11-15 22:07:04,751 INFO L226 Difference]: Without dead ends: 135 [2019-11-15 22:07:04,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=417, Invalid=3489, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 22:07:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-15 22:07:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 106. [2019-11-15 22:07:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 22:07:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2019-11-15 22:07:04,757 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 35 [2019-11-15 22:07:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:04,757 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2019-11-15 22:07:04,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 22:07:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2019-11-15 22:07:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:07:04,758 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:04,758 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:04,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:04,964 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:07:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1839220100, now seen corresponding path program 1 times [2019-11-15 22:07:04,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:04,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834952447] [2019-11-15 22:07:04,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:04,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:04,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:07:05,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834952447] [2019-11-15 22:07:05,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305036978] [2019-11-15 22:07:05,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:05,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 22:07:05,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:05,853 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:05,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-15 22:07:05,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:05,879 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-15 22:07:05,880 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 22:07:05,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2019-11-15 22:07:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:06,339 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:06,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 31 [2019-11-15 22:07:06,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797939623] [2019-11-15 22:07:06,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 22:07:06,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:06,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 22:07:06,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-11-15 22:07:06,344 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 31 states. [2019-11-15 22:07:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:07,875 INFO L93 Difference]: Finished difference Result 183 states and 199 transitions. [2019-11-15 22:07:07,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 22:07:07,876 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2019-11-15 22:07:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:07,877 INFO L225 Difference]: With dead ends: 183 [2019-11-15 22:07:07,877 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:07:07,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=452, Invalid=3088, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 22:07:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:07:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 141. [2019-11-15 22:07:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:07:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2019-11-15 22:07:07,883 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 158 transitions. Word has length 40 [2019-11-15 22:07:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:07,884 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 158 transitions. [2019-11-15 22:07:07,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 22:07:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 158 transitions. [2019-11-15 22:07:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 22:07:07,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:07,885 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:08,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:08,090 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:07:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2004165246, now seen corresponding path program 2 times [2019-11-15 22:07:08,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:08,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688508224] [2019-11-15 22:07:08,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:07:08,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688508224] [2019-11-15 22:07:08,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491472856] [2019-11-15 22:07:08,648 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:08,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:07:08,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:07:08,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-15 22:07:08,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:08,843 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 10 treesize of output 8 [2019-11-15 22:07:08,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:08,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:08,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:08,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-15 22:07:08,939 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 14 treesize of output 10 [2019-11-15 22:07:08,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:08,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:08,950 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 22:07:08,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-11-15 22:07:09,032 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 25 treesize of output 24 [2019-11-15 22:07:09,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:09,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:09,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 22:07:09,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-11-15 22:07:09,633 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:09,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2019-11-15 22:07:09,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:07:09,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:09,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:09,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:09,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:27 [2019-11-15 22:07:09,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:07:10,097 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:10,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2019-11-15 22:07:10,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564801352] [2019-11-15 22:07:10,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 22:07:10,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:10,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 22:07:10,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=803, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:07:10,101 INFO L87 Difference]: Start difference. First operand 141 states and 158 transitions. Second operand 30 states. [2019-11-15 22:07:11,209 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-11-15 22:07:12,709 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-11-15 22:07:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:15,922 INFO L93 Difference]: Finished difference Result 271 states and 297 transitions. [2019-11-15 22:07:15,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 22:07:15,923 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-11-15 22:07:15,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:15,924 INFO L225 Difference]: With dead ends: 271 [2019-11-15 22:07:15,924 INFO L226 Difference]: Without dead ends: 241 [2019-11-15 22:07:15,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=347, Invalid=3435, Unknown=0, NotChecked=0, Total=3782 [2019-11-15 22:07:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-15 22:07:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 212. [2019-11-15 22:07:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-15 22:07:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 240 transitions. [2019-11-15 22:07:15,933 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 240 transitions. Word has length 42 [2019-11-15 22:07:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:15,933 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 240 transitions. [2019-11-15 22:07:15,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 22:07:15,933 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 240 transitions. [2019-11-15 22:07:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 22:07:15,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:15,934 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 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 22:07:16,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:16,139 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:07:16,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:16,139 INFO L82 PathProgramCache]: Analyzing trace with hash -238582885, now seen corresponding path program 3 times [2019-11-15 22:07:16,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:16,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340651625] [2019-11-15 22:07:16,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:16,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:16,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:16,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340651625] [2019-11-15 22:07:16,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983708931] [2019-11-15 22:07:16,485 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:16,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 22:07:16,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:07:16,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 22:07:16,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:16,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:16,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-15 22:07:16,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:16,701 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-15 22:07:16,701 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 22:07:16,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-15 22:07:16,845 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 16 treesize of output 12 [2019-11-15 22:07:16,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:16,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:16,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:16,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 22:07:17,154 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 25 treesize of output 19 [2019-11-15 22:07:17,155 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:07:17,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:17,181 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:07:17,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:17,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2019-11-15 22:07:17,184 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:17,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:17,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:17,194 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2019-11-15 22:07:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:17,201 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:17,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2019-11-15 22:07:17,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012384054] [2019-11-15 22:07:17,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 22:07:17,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:17,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 22:07:17,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-11-15 22:07:17,203 INFO L87 Difference]: Start difference. First operand 212 states and 240 transitions. Second operand 31 states. [2019-11-15 22:07:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:19,109 INFO L93 Difference]: Finished difference Result 358 states and 391 transitions. [2019-11-15 22:07:19,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 22:07:19,110 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2019-11-15 22:07:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:19,112 INFO L225 Difference]: With dead ends: 358 [2019-11-15 22:07:19,112 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 22:07:19,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 22:07:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 22:07:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 224. [2019-11-15 22:07:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-15 22:07:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 253 transitions. [2019-11-15 22:07:19,123 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 253 transitions. Word has length 44 [2019-11-15 22:07:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:19,123 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 253 transitions. [2019-11-15 22:07:19,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 22:07:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 253 transitions. [2019-11-15 22:07:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:07:19,124 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:19,124 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:19,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:19,325 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:07:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash 444391032, now seen corresponding path program 4 times [2019-11-15 22:07:19,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:19,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767189930] [2019-11-15 22:07:19,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:19,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:19,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:19,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767189930] [2019-11-15 22:07:19,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637806012] [2019-11-15 22:07:19,641 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:19,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:07:19,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:07:19,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-15 22:07:19,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:19,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:19,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-15 22:07:19,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:19,837 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-15 22:07:19,837 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 22:07:19,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-15 22:07:20,009 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 16 treesize of output 12 [2019-11-15 22:07:20,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:20,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:20,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:20,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-15 22:07:20,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:20,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-15 22:07:20,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:07:20,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:20,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:20,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-15 22:07:20,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:20,679 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:20,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2019-11-15 22:07:20,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19742644] [2019-11-15 22:07:20,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 22:07:20,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 22:07:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:07:20,682 INFO L87 Difference]: Start difference. First operand 224 states and 253 transitions. Second operand 34 states. [2019-11-15 22:07:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:22,779 INFO L93 Difference]: Finished difference Result 351 states and 386 transitions. [2019-11-15 22:07:22,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:07:22,779 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-11-15 22:07:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:22,781 INFO L225 Difference]: With dead ends: 351 [2019-11-15 22:07:22,782 INFO L226 Difference]: Without dead ends: 351 [2019-11-15 22:07:22,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=340, Invalid=2630, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 22:07:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-15 22:07:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 249. [2019-11-15 22:07:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-15 22:07:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 282 transitions. [2019-11-15 22:07:22,792 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 282 transitions. Word has length 48 [2019-11-15 22:07:22,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:22,792 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 282 transitions. [2019-11-15 22:07:22,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 22:07:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 282 transitions. [2019-11-15 22:07:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:07:22,793 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:22,794 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:22,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:22,998 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:07:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:22,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1257119417, now seen corresponding path program 5 times [2019-11-15 22:07:22,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:22,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371741864] [2019-11-15 22:07:22,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:22,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:22,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:23,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371741864] [2019-11-15 22:07:23,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223892510] [2019-11-15 22:07:23,376 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:23,568 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-15 22:07:23,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:07:23,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-15 22:07:23,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:23,777 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 14 treesize of output 10 [2019-11-15 22:07:23,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:23,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:23,785 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 22:07:23,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 22:07:24,069 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 22:07:24,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:24,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:24,073 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 22:07:24,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 22:07:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:24,078 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:24,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 31 [2019-11-15 22:07:24,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585609010] [2019-11-15 22:07:24,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 22:07:24,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 22:07:24,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2019-11-15 22:07:24,081 INFO L87 Difference]: Start difference. First operand 249 states and 282 transitions. Second operand 31 states. [2019-11-15 22:07:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:25,699 INFO L93 Difference]: Finished difference Result 425 states and 468 transitions. [2019-11-15 22:07:25,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 22:07:25,700 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2019-11-15 22:07:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:25,702 INFO L225 Difference]: With dead ends: 425 [2019-11-15 22:07:25,702 INFO L226 Difference]: Without dead ends: 352 [2019-11-15 22:07:25,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=208, Invalid=1684, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 22:07:25,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-15 22:07:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 321. [2019-11-15 22:07:25,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-15 22:07:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 362 transitions. [2019-11-15 22:07:25,714 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 362 transitions. Word has length 53 [2019-11-15 22:07:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:25,715 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 362 transitions. [2019-11-15 22:07:25,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 22:07:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 362 transitions. [2019-11-15 22:07:25,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:07:25,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:25,716 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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 22:07:25,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:25,930 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:07:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:25,931 INFO L82 PathProgramCache]: Analyzing trace with hash 902326762, now seen corresponding path program 3 times [2019-11-15 22:07:25,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:25,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190487476] [2019-11-15 22:07:25,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:25,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:25,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:27,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190487476] [2019-11-15 22:07:27,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503096217] [2019-11-15 22:07:27,537 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:27,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 22:07:27,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:07:27,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 22:07:27,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:27,775 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_30|]} [2019-11-15 22:07:27,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:07:27,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-15 22:07:27,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:27,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:27,804 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 10 treesize of output 8 [2019-11-15 22:07:27,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:27,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:27,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:27,817 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-15 22:07:28,146 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 16 treesize of output 12 [2019-11-15 22:07:28,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:28,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:28,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:28,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 22:07:28,226 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 29 treesize of output 28 [2019-11-15 22:07:28,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:28,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:28,237 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 22:07:28,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2019-11-15 22:07:28,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-11-15 22:07:28,918 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:07:28,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:28,953 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:07:28,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 22:07:28,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:28,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:28,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:28,974 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:56, output treesize:3 [2019-11-15 22:07:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:07:29,250 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:29,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 16] total 44 [2019-11-15 22:07:29,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092855867] [2019-11-15 22:07:29,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-15 22:07:29,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:29,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-15 22:07:29,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1786, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 22:07:29,255 INFO L87 Difference]: Start difference. First operand 321 states and 362 transitions. Second operand 44 states. [2019-11-15 22:07:31,577 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-11-15 22:07:38,844 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 22:07:47,873 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-15 22:07:52,154 WARN L191 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-15 22:07:56,669 WARN L191 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-15 22:08:03,035 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-15 22:08:07,403 WARN L191 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-11-15 22:08:11,797 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-15 22:08:15,953 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-15 22:08:20,115 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-15 22:08:20,329 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-11-15 22:08:20,570 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-11-15 22:08:21,789 WARN L191 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-15 22:08:22,255 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-15 22:08:24,515 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-15 22:08:24,918 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-11-15 22:08:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:25,638 INFO L93 Difference]: Finished difference Result 598 states and 658 transitions. [2019-11-15 22:08:25,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-15 22:08:25,638 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2019-11-15 22:08:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:25,640 INFO L225 Difference]: With dead ends: 598 [2019-11-15 22:08:25,640 INFO L226 Difference]: Without dead ends: 453 [2019-11-15 22:08:25,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 56.8s TimeCoverageRelationStatistics Valid=814, Invalid=8883, Unknown=5, NotChecked=0, Total=9702 [2019-11-15 22:08:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-15 22:08:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 372. [2019-11-15 22:08:25,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-15 22:08:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 420 transitions. [2019-11-15 22:08:25,652 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 420 transitions. Word has length 54 [2019-11-15 22:08:25,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:25,652 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 420 transitions. [2019-11-15 22:08:25,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-15 22:08:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 420 transitions. [2019-11-15 22:08:25,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:08:25,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:25,654 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:25,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:25,857 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:08:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1026060042, now seen corresponding path program 6 times [2019-11-15 22:08:25,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:25,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907954019] [2019-11-15 22:08:25,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:25,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:25,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 17 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:26,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907954019] [2019-11-15 22:08:26,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205396324] [2019-11-15 22:08:26,172 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:26,311 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-15 22:08:26,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:08:26,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 22:08:26,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:26,325 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:26,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-15 22:08:26,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:26,339 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-15 22:08:26,339 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 22:08:26,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-15 22:08:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:26,619 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:26,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2019-11-15 22:08:26,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984669295] [2019-11-15 22:08:26,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 22:08:26,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:26,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 22:08:26,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2019-11-15 22:08:26,621 INFO L87 Difference]: Start difference. First operand 372 states and 420 transitions. Second operand 29 states. [2019-11-15 22:08:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:27,478 INFO L93 Difference]: Finished difference Result 478 states and 530 transitions. [2019-11-15 22:08:27,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:08:27,478 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2019-11-15 22:08:27,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:27,480 INFO L225 Difference]: With dead ends: 478 [2019-11-15 22:08:27,480 INFO L226 Difference]: Without dead ends: 478 [2019-11-15 22:08:27,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=1296, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 22:08:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-15 22:08:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 402. [2019-11-15 22:08:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-11-15 22:08:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 455 transitions. [2019-11-15 22:08:27,490 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 455 transitions. Word has length 57 [2019-11-15 22:08:27,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:27,491 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 455 transitions. [2019-11-15 22:08:27,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 22:08:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 455 transitions. [2019-11-15 22:08:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 22:08:27,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:27,492 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:27,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:27,693 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:08:27,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1882013497, now seen corresponding path program 4 times [2019-11-15 22:08:27,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:27,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028438294] [2019-11-15 22:08:27,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:27,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:27,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:08:27,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028438294] [2019-11-15 22:08:27,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871307986] [2019-11-15 22:08:27,958 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:28,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:08:28,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:08:28,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 90 conjunts are in the unsatisfiable core [2019-11-15 22:08:28,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:28,137 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 1=[|v_#valid_31|]} [2019-11-15 22:08:28,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:08:28,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-15 22:08:28,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:28,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:28,156 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 10 treesize of output 8 [2019-11-15 22:08:28,156 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:28,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:28,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:28,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-15 22:08:28,333 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 16 treesize of output 12 [2019-11-15 22:08:28,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:28,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:28,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:28,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-15 22:08:28,392 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 29 treesize of output 28 [2019-11-15 22:08:28,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:28,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:28,406 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 22:08:28,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-15 22:08:29,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:29,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2019-11-15 22:08:29,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:29,524 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.5 percent of original size [2019-11-15 22:08:29,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:29,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:30 [2019-11-15 22:08:29,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:08:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:08:29,731 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:29,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 39 [2019-11-15 22:08:29,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354922434] [2019-11-15 22:08:29,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 22:08:29,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:29,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 22:08:29,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1452, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:08:29,732 INFO L87 Difference]: Start difference. First operand 402 states and 455 transitions. Second operand 40 states. [2019-11-15 22:08:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:34,364 INFO L93 Difference]: Finished difference Result 537 states and 599 transitions. [2019-11-15 22:08:34,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-11-15 22:08:34,365 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 58 [2019-11-15 22:08:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:34,367 INFO L225 Difference]: With dead ends: 537 [2019-11-15 22:08:34,367 INFO L226 Difference]: Without dead ends: 537 [2019-11-15 22:08:34,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=570, Invalid=6402, Unknown=0, NotChecked=0, Total=6972 [2019-11-15 22:08:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-11-15 22:08:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 463. [2019-11-15 22:08:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-11-15 22:08:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 525 transitions. [2019-11-15 22:08:34,381 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 525 transitions. Word has length 58 [2019-11-15 22:08:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:34,381 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 525 transitions. [2019-11-15 22:08:34,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 22:08:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 525 transitions. [2019-11-15 22:08:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:08:34,382 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:34,383 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:34,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:34,586 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:08:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash 943971317, now seen corresponding path program 7 times [2019-11-15 22:08:34,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:34,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928089181] [2019-11-15 22:08:34,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:34,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:34,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 14 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:35,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928089181] [2019-11-15 22:08:35,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061484562] [2019-11-15 22:08:35,001 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:35,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-15 22:08:35,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:35,363 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 14 treesize of output 10 [2019-11-15 22:08:35,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:35,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:35,373 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 22:08:35,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 22:08:35,568 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 22:08:35,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:35,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:35,570 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 22:08:35,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 22:08:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 14 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:35,576 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:35,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 34 [2019-11-15 22:08:35,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929134203] [2019-11-15 22:08:35,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 22:08:35,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:35,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 22:08:35,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:08:35,577 INFO L87 Difference]: Start difference. First operand 463 states and 525 transitions. Second operand 34 states. [2019-11-15 22:08:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:36,821 INFO L93 Difference]: Finished difference Result 762 states and 845 transitions. [2019-11-15 22:08:36,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:08:36,833 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-11-15 22:08:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:36,836 INFO L225 Difference]: With dead ends: 762 [2019-11-15 22:08:36,836 INFO L226 Difference]: Without dead ends: 629 [2019-11-15 22:08:36,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=226, Invalid=2030, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:08:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-11-15 22:08:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 577. [2019-11-15 22:08:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-11-15 22:08:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 653 transitions. [2019-11-15 22:08:36,852 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 653 transitions. Word has length 62 [2019-11-15 22:08:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:36,852 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 653 transitions. [2019-11-15 22:08:36,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 22:08:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 653 transitions. [2019-11-15 22:08:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:08:36,854 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:36,854 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:37,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:37,058 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:08:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash -265479790, now seen corresponding path program 8 times [2019-11-15 22:08:37,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:37,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296338742] [2019-11-15 22:08:37,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:37,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:37,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 30 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:37,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296338742] [2019-11-15 22:08:37,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793046093] [2019-11-15 22:08:37,347 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:37,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:08:37,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:08:37,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-15 22:08:37,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:37,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:37,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-15 22:08:37,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:37,573 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-15 22:08:37,573 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 22:08:37,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-15 22:08:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 28 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:38,029 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:38,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2019-11-15 22:08:38,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098323182] [2019-11-15 22:08:38,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-15 22:08:38,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:38,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-15 22:08:38,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1290, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 22:08:38,030 INFO L87 Difference]: Start difference. First operand 577 states and 653 transitions. Second operand 38 states. [2019-11-15 22:08:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:39,446 INFO L93 Difference]: Finished difference Result 720 states and 801 transitions. [2019-11-15 22:08:39,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:08:39,447 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 66 [2019-11-15 22:08:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:39,450 INFO L225 Difference]: With dead ends: 720 [2019-11-15 22:08:39,450 INFO L226 Difference]: Without dead ends: 720 [2019-11-15 22:08:39,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=312, Invalid=2658, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 22:08:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-11-15 22:08:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 612. [2019-11-15 22:08:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-11-15 22:08:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 694 transitions. [2019-11-15 22:08:39,464 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 694 transitions. Word has length 66 [2019-11-15 22:08:39,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:39,464 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 694 transitions. [2019-11-15 22:08:39,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-15 22:08:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 694 transitions. [2019-11-15 22:08:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:08:39,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:39,466 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:39,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:39,670 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:08:39,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:39,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1777014062, now seen corresponding path program 5 times [2019-11-15 22:08:39,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:39,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837611364] [2019-11-15 22:08:39,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:39,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:39,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:08:40,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837611364] [2019-11-15 22:08:40,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155709785] [2019-11-15 22:08:40,354 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:40,555 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-15 22:08:40,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:08:40,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 104 conjunts are in the unsatisfiable core [2019-11-15 22:08:40,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:40,567 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 10 treesize of output 8 [2019-11-15 22:08:40,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:40,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:40,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:40,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 22:08:40,779 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 14 treesize of output 10 [2019-11-15 22:08:40,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:40,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:40,788 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 22:08:40,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-15 22:08:40,833 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 25 treesize of output 24 [2019-11-15 22:08:40,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:40,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:40,843 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 22:08:40,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:34 [2019-11-15 22:08:42,124 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:08:42,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 69 [2019-11-15 22:08:42,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:08:42,171 INFO L567 ElimStorePlain]: treesize reduction 31, result has 53.7 percent of original size [2019-11-15 22:08:42,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:08:42,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:52, output treesize:8 [2019-11-15 22:08:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:08:42,305 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:42,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2019-11-15 22:08:42,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271288714] [2019-11-15 22:08:42,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-15 22:08:42,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-15 22:08:42,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2521, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 22:08:42,307 INFO L87 Difference]: Start difference. First operand 612 states and 694 transitions. Second operand 52 states. [2019-11-15 22:08:47,394 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-11-15 22:08:52,004 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:08:56,126 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:09:00,291 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:09:04,436 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-11-15 22:09:08,561 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-15 22:09:12,703 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-15 22:09:16,838 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-11-15 22:09:21,056 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-11-15 22:09:25,613 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:09:29,772 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-11-15 22:09:33,936 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-11-15 22:09:38,081 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:09:42,263 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-11-15 22:09:46,367 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-11-15 22:09:50,482 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:09:54,619 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-11-15 22:09:58,774 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-11-15 22:10:02,893 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:10:07,095 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:10:11,286 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:10:15,386 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:10:19,530 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-11-15 22:10:23,656 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-15 22:10:27,774 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-15 22:10:27,979 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-11-15 22:10:32,074 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:10:32,279 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-11-15 22:10:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:32,605 INFO L93 Difference]: Finished difference Result 1090 states and 1229 transitions. [2019-11-15 22:10:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-15 22:10:32,605 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 66 [2019-11-15 22:10:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:32,609 INFO L225 Difference]: With dead ends: 1090 [2019-11-15 22:10:32,609 INFO L226 Difference]: Without dead ends: 1090 [2019-11-15 22:10:32,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 109.9s TimeCoverageRelationStatistics Valid=543, Invalid=8013, Unknown=0, NotChecked=0, Total=8556 [2019-11-15 22:10:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-11-15 22:10:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 953. [2019-11-15 22:10:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-15 22:10:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1080 transitions. [2019-11-15 22:10:32,627 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1080 transitions. Word has length 66 [2019-11-15 22:10:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:32,627 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1080 transitions. [2019-11-15 22:10:32,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-15 22:10:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1080 transitions. [2019-11-15 22:10:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:10:32,629 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:32,630 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:32,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:32,837 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:10:32,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:32,837 INFO L82 PathProgramCache]: Analyzing trace with hash 476765743, now seen corresponding path program 6 times [2019-11-15 22:10:32,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:32,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093762906] [2019-11-15 22:10:32,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:32,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:32,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 17 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:10:33,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093762906] [2019-11-15 22:10:33,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845924069] [2019-11-15 22:10:33,131 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:33,310 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-15 22:10:33,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:33,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-15 22:10:33,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 15 proven. 69 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:10:33,466 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:33,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 25 [2019-11-15 22:10:33,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278471079] [2019-11-15 22:10:33,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 22:10:33,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:33,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 22:10:33,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:10:33,467 INFO L87 Difference]: Start difference. First operand 953 states and 1080 transitions. Second operand 26 states. [2019-11-15 22:10:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:34,233 INFO L93 Difference]: Finished difference Result 1141 states and 1292 transitions. [2019-11-15 22:10:34,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:10:34,233 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2019-11-15 22:10:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:34,237 INFO L225 Difference]: With dead ends: 1141 [2019-11-15 22:10:34,237 INFO L226 Difference]: Without dead ends: 1141 [2019-11-15 22:10:34,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:10:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-11-15 22:10:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1042. [2019-11-15 22:10:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-11-15 22:10:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1182 transitions. [2019-11-15 22:10:34,254 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1182 transitions. Word has length 70 [2019-11-15 22:10:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:34,254 INFO L462 AbstractCegarLoop]: Abstraction has 1042 states and 1182 transitions. [2019-11-15 22:10:34,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 22:10:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1182 transitions. [2019-11-15 22:10:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 22:10:34,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:34,257 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:34,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:34,460 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:10:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:34,461 INFO L82 PathProgramCache]: Analyzing trace with hash -944994707, now seen corresponding path program 9 times [2019-11-15 22:10:34,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:34,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671012793] [2019-11-15 22:10:34,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:34,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:34,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 17 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:34,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671012793] [2019-11-15 22:10:34,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91208210] [2019-11-15 22:10:34,791 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:34,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-15 22:10:34,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:34,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-15 22:10:34,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:35,193 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 14 treesize of output 10 [2019-11-15 22:10:35,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:35,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:35,199 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 22:10:35,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 22:10:35,359 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 22:10:35,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:35,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:35,361 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 22:10:35,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 22:10:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 17 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:35,369 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:35,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 37 [2019-11-15 22:10:35,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124862291] [2019-11-15 22:10:35,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 22:10:35,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:35,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 22:10:35,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1236, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 22:10:35,370 INFO L87 Difference]: Start difference. First operand 1042 states and 1182 transitions. Second operand 37 states. [2019-11-15 22:10:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:36,930 INFO L93 Difference]: Finished difference Result 1592 states and 1776 transitions. [2019-11-15 22:10:36,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 22:10:36,930 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-11-15 22:10:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:36,935 INFO L225 Difference]: With dead ends: 1592 [2019-11-15 22:10:36,935 INFO L226 Difference]: Without dead ends: 1422 [2019-11-15 22:10:36,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=2408, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 22:10:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2019-11-15 22:10:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1304. [2019-11-15 22:10:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2019-11-15 22:10:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1479 transitions. [2019-11-15 22:10:36,955 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1479 transitions. Word has length 71 [2019-11-15 22:10:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:36,956 INFO L462 AbstractCegarLoop]: Abstraction has 1304 states and 1479 transitions. [2019-11-15 22:10:36,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 22:10:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1479 transitions. [2019-11-15 22:10:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 22:10:36,958 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:36,958 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 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 22:10:37,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:37,162 INFO L410 AbstractCegarLoop]: === Iteration 37 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:10:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1355836777, now seen corresponding path program 1 times [2019-11-15 22:10:37,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:37,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601106717] [2019-11-15 22:10:37,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:37,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:37,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-15 22:10:37,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601106717] [2019-11-15 22:10:37,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982961408] [2019-11-15 22:10:37,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:37,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-15 22:10:37,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:37,807 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 14 treesize of output 10 [2019-11-15 22:10:37,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:37,813 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 22:10:37,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-15 22:10:37,992 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 22:10:37,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:37,993 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 22:10:37,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 22:10:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-15 22:10:38,007 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:38,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2019-11-15 22:10:38,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867496028] [2019-11-15 22:10:38,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 22:10:38,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:38,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 22:10:38,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:10:38,008 INFO L87 Difference]: Start difference. First operand 1304 states and 1479 transitions. Second operand 27 states. [2019-11-15 22:10:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:38,537 INFO L93 Difference]: Finished difference Result 1419 states and 1594 transitions. [2019-11-15 22:10:38,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:10:38,537 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2019-11-15 22:10:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:38,541 INFO L225 Difference]: With dead ends: 1419 [2019-11-15 22:10:38,541 INFO L226 Difference]: Without dead ends: 1351 [2019-11-15 22:10:38,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=1212, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 22:10:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-11-15 22:10:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1350. [2019-11-15 22:10:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2019-11-15 22:10:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1525 transitions. [2019-11-15 22:10:38,561 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1525 transitions. Word has length 71 [2019-11-15 22:10:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:38,562 INFO L462 AbstractCegarLoop]: Abstraction has 1350 states and 1525 transitions. [2019-11-15 22:10:38,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 22:10:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1525 transitions. [2019-11-15 22:10:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 22:10:38,564 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:38,564 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:38,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:38,768 INFO L410 AbstractCegarLoop]: === Iteration 38 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:10:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash 920799600, now seen corresponding path program 10 times [2019-11-15 22:10:38,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:38,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781500680] [2019-11-15 22:10:38,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:38,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:38,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 47 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:39,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781500680] [2019-11-15 22:10:39,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323158222] [2019-11-15 22:10:39,145 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:39,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:10:39,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:39,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 82 conjunts are in the unsatisfiable core [2019-11-15 22:10:39,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:39,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:39,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-15 22:10:39,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:39,380 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-15 22:10:39,381 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 22:10:39,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-15 22:10:39,745 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 16 treesize of output 12 [2019-11-15 22:10:39,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:39,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:39,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:39,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-15 22:10:40,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-15 22:10:40,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:10:40,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-15 22:10:40,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 50 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:40,389 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:40,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 45 [2019-11-15 22:10:40,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129611592] [2019-11-15 22:10:40,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-15 22:10:40,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:40,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-15 22:10:40,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1901, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 22:10:40,390 INFO L87 Difference]: Start difference. First operand 1350 states and 1525 transitions. Second operand 46 states. [2019-11-15 22:10:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:43,444 INFO L93 Difference]: Finished difference Result 1705 states and 1888 transitions. [2019-11-15 22:10:43,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 22:10:43,457 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 75 [2019-11-15 22:10:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:43,464 INFO L225 Difference]: With dead ends: 1705 [2019-11-15 22:10:43,464 INFO L226 Difference]: Without dead ends: 1705 [2019-11-15 22:10:43,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=508, Invalid=4748, Unknown=0, NotChecked=0, Total=5256 [2019-11-15 22:10:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2019-11-15 22:10:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1405. [2019-11-15 22:10:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-11-15 22:10:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1590 transitions. [2019-11-15 22:10:43,488 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1590 transitions. Word has length 75 [2019-11-15 22:10:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:43,488 INFO L462 AbstractCegarLoop]: Abstraction has 1405 states and 1590 transitions. [2019-11-15 22:10:43,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-15 22:10:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1590 transitions. [2019-11-15 22:10:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 22:10:43,491 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:43,491 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:43,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:43,706 INFO L410 AbstractCegarLoop]: === Iteration 39 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:10:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:43,707 INFO L82 PathProgramCache]: Analyzing trace with hash 337461100, now seen corresponding path program 2 times [2019-11-15 22:10:43,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:43,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265210691] [2019-11-15 22:10:43,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:43,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:43,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 8 proven. 85 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 22:10:44,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265210691] [2019-11-15 22:10:44,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521584157] [2019-11-15 22:10:44,483 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:44,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:10:44,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:44,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-15 22:10:44,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:44,667 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 10 treesize of output 8 [2019-11-15 22:10:44,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-15 22:10:44,789 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 14 treesize of output 10 [2019-11-15 22:10:44,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,796 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 22:10:44,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-11-15 22:10:44,838 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 25 treesize of output 24 [2019-11-15 22:10:44,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:44,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-11-15 22:10:45,386 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:45,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2019-11-15 22:10:45,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:10:45,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:45,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:45,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:45,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:27 [2019-11-15 22:10:45,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 7 proven. 80 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:10:45,697 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:45,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 44 [2019-11-15 22:10:45,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414732271] [2019-11-15 22:10:45,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-15 22:10:45,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:45,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-15 22:10:45,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1793, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 22:10:45,698 INFO L87 Difference]: Start difference. First operand 1405 states and 1590 transitions. Second operand 44 states. [2019-11-15 22:10:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:56,576 INFO L93 Difference]: Finished difference Result 1509 states and 1701 transitions. [2019-11-15 22:10:56,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-11-15 22:10:56,576 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 75 [2019-11-15 22:10:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:56,581 INFO L225 Difference]: With dead ends: 1509 [2019-11-15 22:10:56,581 INFO L226 Difference]: Without dead ends: 1453 [2019-11-15 22:10:56,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=687, Invalid=9818, Unknown=1, NotChecked=0, Total=10506 [2019-11-15 22:10:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-11-15 22:10:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1354. [2019-11-15 22:10:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1354 states. [2019-11-15 22:10:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1535 transitions. [2019-11-15 22:10:56,597 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1535 transitions. Word has length 75 [2019-11-15 22:10:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:56,598 INFO L462 AbstractCegarLoop]: Abstraction has 1354 states and 1535 transitions. [2019-11-15 22:10:56,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-15 22:10:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1535 transitions. [2019-11-15 22:10:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 22:10:56,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:56,600 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:56,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:56,804 INFO L410 AbstractCegarLoop]: === Iteration 40 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:10:56,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:56,804 INFO L82 PathProgramCache]: Analyzing trace with hash 118300730, now seen corresponding path program 7 times [2019-11-15 22:10:56,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:56,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145531076] [2019-11-15 22:10:56,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:56,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:56,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:10:57,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145531076] [2019-11-15 22:10:57,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807196732] [2019-11-15 22:10:57,604 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:57,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 102 conjunts are in the unsatisfiable core [2019-11-15 22:10:57,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:57,798 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 10 treesize of output 8 [2019-11-15 22:10:57,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:57,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:57,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:57,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-15 22:10:58,066 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 14 treesize of output 10 [2019-11-15 22:10:58,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:58,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:58,072 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 22:10:58,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-15 22:10:58,115 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 25 treesize of output 24 [2019-11-15 22:10:58,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:58,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:58,123 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 22:10:58,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:31 [2019-11-15 22:10:59,134 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:59,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 39 [2019-11-15 22:10:59,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:59,155 INFO L567 ElimStorePlain]: treesize reduction 12, result has 67.6 percent of original size [2019-11-15 22:10:59,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:59,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:53, output treesize:8 [2019-11-15 22:10:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:10:59,274 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:59,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 55 [2019-11-15 22:10:59,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812977093] [2019-11-15 22:10:59,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-15 22:10:59,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:59,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-15 22:10:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2825, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 22:10:59,275 INFO L87 Difference]: Start difference. First operand 1354 states and 1535 transitions. Second operand 55 states. [2019-11-15 22:11:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:04,563 INFO L93 Difference]: Finished difference Result 2157 states and 2433 transitions. [2019-11-15 22:11:04,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-15 22:11:04,563 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 78 [2019-11-15 22:11:04,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:04,572 INFO L225 Difference]: With dead ends: 2157 [2019-11-15 22:11:04,572 INFO L226 Difference]: Without dead ends: 2113 [2019-11-15 22:11:04,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=546, Invalid=8010, Unknown=0, NotChecked=0, Total=8556 [2019-11-15 22:11:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2019-11-15 22:11:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1932. [2019-11-15 22:11:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1932 states. [2019-11-15 22:11:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2191 transitions. [2019-11-15 22:11:04,596 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2191 transitions. Word has length 78 [2019-11-15 22:11:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:04,596 INFO L462 AbstractCegarLoop]: Abstraction has 1932 states and 2191 transitions. [2019-11-15 22:11:04,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-15 22:11:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2191 transitions. [2019-11-15 22:11:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 22:11:04,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:04,599 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:04,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:04,805 INFO L410 AbstractCegarLoop]: === Iteration 41 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:11:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash 414224719, now seen corresponding path program 11 times [2019-11-15 22:11:04,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:04,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885882401] [2019-11-15 22:11:04,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:04,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:04,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 20 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:05,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885882401] [2019-11-15 22:11:05,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901735199] [2019-11-15 22:11:05,219 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:05,399 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-15 22:11:05,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:11:05,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 87 conjunts are in the unsatisfiable core [2019-11-15 22:11:05,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:05,610 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 14 treesize of output 10 [2019-11-15 22:11:05,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,620 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 22:11:05,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 22:11:05,880 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 22:11:05,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,885 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 22:11:05,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 22:11:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 20 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:05,900 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:05,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 40 [2019-11-15 22:11:05,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206669513] [2019-11-15 22:11:05,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 22:11:05,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:05,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 22:11:05,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1456, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:11:05,905 INFO L87 Difference]: Start difference. First operand 1932 states and 2191 transitions. Second operand 40 states. [2019-11-15 22:11:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:07,699 INFO L93 Difference]: Finished difference Result 2788 states and 3122 transitions. [2019-11-15 22:11:07,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:11:07,700 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2019-11-15 22:11:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:07,707 INFO L225 Difference]: With dead ends: 2788 [2019-11-15 22:11:07,707 INFO L226 Difference]: Without dead ends: 2581 [2019-11-15 22:11:07,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=262, Invalid=2818, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 22:11:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2019-11-15 22:11:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2382. [2019-11-15 22:11:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2382 states. [2019-11-15 22:11:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 2705 transitions. [2019-11-15 22:11:07,728 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 2705 transitions. Word has length 80 [2019-11-15 22:11:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:07,728 INFO L462 AbstractCegarLoop]: Abstraction has 2382 states and 2705 transitions. [2019-11-15 22:11:07,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 22:11:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 2705 transitions. [2019-11-15 22:11:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 22:11:07,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:07,731 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:07,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:07,935 INFO L410 AbstractCegarLoop]: === Iteration 42 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:11:07,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:07,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1163399145, now seen corresponding path program 8 times [2019-11-15 22:11:07,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:07,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402416625] [2019-11-15 22:11:07,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:07,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:07,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 30 proven. 105 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:11:08,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402416625] [2019-11-15 22:11:08,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815721284] [2019-11-15 22:11:08,243 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:08,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:11:08,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:11:08,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-15 22:11:08,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 28 proven. 107 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:11:08,723 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:08,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2019-11-15 22:11:08,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378741167] [2019-11-15 22:11:08,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 22:11:08,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:08,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 22:11:08,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:11:08,724 INFO L87 Difference]: Start difference. First operand 2382 states and 2705 transitions. Second operand 30 states. [2019-11-15 22:11:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:09,775 INFO L93 Difference]: Finished difference Result 2826 states and 3211 transitions. [2019-11-15 22:11:09,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 22:11:09,775 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 82 [2019-11-15 22:11:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:09,784 INFO L225 Difference]: With dead ends: 2826 [2019-11-15 22:11:09,784 INFO L226 Difference]: Without dead ends: 2826 [2019-11-15 22:11:09,784 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=1438, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:11:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2019-11-15 22:11:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2545. [2019-11-15 22:11:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2545 states. [2019-11-15 22:11:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 2891 transitions. [2019-11-15 22:11:09,809 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 2891 transitions. Word has length 82 [2019-11-15 22:11:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:09,809 INFO L462 AbstractCegarLoop]: Abstraction has 2545 states and 2891 transitions. [2019-11-15 22:11:09,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 22:11:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 2891 transitions. [2019-11-15 22:11:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:11:09,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:09,812 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:10,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:10,016 INFO L410 AbstractCegarLoop]: === Iteration 43 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:11:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:10,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1021148756, now seen corresponding path program 12 times [2019-11-15 22:11:10,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:10,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873183250] [2019-11-15 22:11:10,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:10,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:10,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 68 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:10,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873183250] [2019-11-15 22:11:10,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681381070] [2019-11-15 22:11:10,490 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:10,795 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-15 22:11:10,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:11:10,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-15 22:11:10,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:10,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:10,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-15 22:11:10,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:10,837 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-15 22:11:10,837 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 22:11:10,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-15 22:11:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 66 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:11,502 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:11,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 45 [2019-11-15 22:11:11,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147007762] [2019-11-15 22:11:11,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-15 22:11:11,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:11,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-15 22:11:11,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1891, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 22:11:11,504 INFO L87 Difference]: Start difference. First operand 2545 states and 2891 transitions. Second operand 46 states. [2019-11-15 22:11:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:14,042 INFO L93 Difference]: Finished difference Result 2973 states and 3333 transitions. [2019-11-15 22:11:14,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 22:11:14,042 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 84 [2019-11-15 22:11:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:14,051 INFO L225 Difference]: With dead ends: 2973 [2019-11-15 22:11:14,051 INFO L226 Difference]: Without dead ends: 2973 [2019-11-15 22:11:14,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=582, Invalid=4674, Unknown=0, NotChecked=0, Total=5256 [2019-11-15 22:11:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2019-11-15 22:11:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2625. [2019-11-15 22:11:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2019-11-15 22:11:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 2986 transitions. [2019-11-15 22:11:14,081 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 2986 transitions. Word has length 84 [2019-11-15 22:11:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:14,081 INFO L462 AbstractCegarLoop]: Abstraction has 2625 states and 2986 transitions. [2019-11-15 22:11:14,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-15 22:11:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 2986 transitions. [2019-11-15 22:11:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:11:14,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:14,085 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:14,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:14,289 INFO L410 AbstractCegarLoop]: === Iteration 44 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:11:14,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:14,289 INFO L82 PathProgramCache]: Analyzing trace with hash -414721542, now seen corresponding path program 3 times [2019-11-15 22:11:14,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:14,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483492897] [2019-11-15 22:11:14,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:14,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:14,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 99 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 22:11:14,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483492897] [2019-11-15 22:11:14,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321359025] [2019-11-15 22:11:14,528 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:14,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-15 22:11:14,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:11:14,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 22:11:14,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:14,797 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_29|], 1=[|v_#valid_35|]} [2019-11-15 22:11:14,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:11:14,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-15 22:11:14,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:14,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:14,831 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 10 treesize of output 8 [2019-11-15 22:11:14,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:14,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:14,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:14,844 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-15 22:11:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 22:11:15,204 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:15,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-11-15 22:11:15,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595708259] [2019-11-15 22:11:15,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 22:11:15,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:15,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 22:11:15,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2019-11-15 22:11:15,207 INFO L87 Difference]: Start difference. First operand 2625 states and 2986 transitions. Second operand 29 states. [2019-11-15 22:11:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:16,081 INFO L93 Difference]: Finished difference Result 2881 states and 3262 transitions. [2019-11-15 22:11:16,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 22:11:16,082 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 87 [2019-11-15 22:11:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:16,089 INFO L225 Difference]: With dead ends: 2881 [2019-11-15 22:11:16,090 INFO L226 Difference]: Without dead ends: 2447 [2019-11-15 22:11:16,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=1385, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:11:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2019-11-15 22:11:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2173. [2019-11-15 22:11:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2173 states. [2019-11-15 22:11:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 2470 transitions. [2019-11-15 22:11:16,109 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 2470 transitions. Word has length 87 [2019-11-15 22:11:16,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:16,109 INFO L462 AbstractCegarLoop]: Abstraction has 2173 states and 2470 transitions. [2019-11-15 22:11:16,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 22:11:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 2470 transitions. [2019-11-15 22:11:16,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:11:16,111 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:16,112 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:16,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:16,316 INFO L410 AbstractCegarLoop]: === Iteration 45 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:11:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:16,316 INFO L82 PathProgramCache]: Analyzing trace with hash -444604796, now seen corresponding path program 4 times [2019-11-15 22:11:16,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:16,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611495208] [2019-11-15 22:11:16,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:16,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:16,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 10 proven. 129 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:11:16,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611495208] [2019-11-15 22:11:16,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573918192] [2019-11-15 22:11:16,892 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:17,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:11:17,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:11:17,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-15 22:11:17,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:17,083 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_36|]} [2019-11-15 22:11:17,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:11:17,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-15 22:11:17,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:17,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:17,097 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 10 treesize of output 8 [2019-11-15 22:11:17,097 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:17,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:17,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:17,107 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-15 22:11:17,328 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 15 treesize of output 11 [2019-11-15 22:11:17,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:17,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:17,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:17,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-15 22:11:17,372 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 28 treesize of output 27 [2019-11-15 22:11:17,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:17,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:17,379 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 22:11:17,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-11-15 22:11:17,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-11-15 22:11:17,828 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:17,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:17,842 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:11:17,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2019-11-15 22:11:17,842 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:17,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:17,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:17,849 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:50, output treesize:3 [2019-11-15 22:11:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 60 proven. 79 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:11:17,920 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:17,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2019-11-15 22:11:17,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309088236] [2019-11-15 22:11:17,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-15 22:11:17,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:17,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-15 22:11:17,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1382, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 22:11:17,921 INFO L87 Difference]: Start difference. First operand 2173 states and 2470 transitions. Second operand 39 states. [2019-11-15 22:11:19,397 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-15 22:11:20,544 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-15 22:11:21,761 WARN L191 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-15 22:11:24,038 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-15 22:11:28,746 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 22:11:31,734 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-15 22:11:32,722 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-15 22:11:33,017 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-11-15 22:11:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:48,014 INFO L93 Difference]: Finished difference Result 2567 states and 2881 transitions. [2019-11-15 22:11:48,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-15 22:11:48,015 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 87 [2019-11-15 22:11:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:48,022 INFO L225 Difference]: With dead ends: 2567 [2019-11-15 22:11:48,022 INFO L226 Difference]: Without dead ends: 1972 [2019-11-15 22:11:48,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1641 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=814, Invalid=7921, Unknown=7, NotChecked=0, Total=8742 [2019-11-15 22:11:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-11-15 22:11:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1510. [2019-11-15 22:11:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2019-11-15 22:11:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1715 transitions. [2019-11-15 22:11:48,037 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1715 transitions. Word has length 87 [2019-11-15 22:11:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:48,037 INFO L462 AbstractCegarLoop]: Abstraction has 1510 states and 1715 transitions. [2019-11-15 22:11:48,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-15 22:11:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1715 transitions. [2019-11-15 22:11:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:11:48,056 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:48,056 INFO L380 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:48,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:48,257 INFO L410 AbstractCegarLoop]: === Iteration 46 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:11:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:48,257 INFO L82 PathProgramCache]: Analyzing trace with hash 708189843, now seen corresponding path program 13 times [2019-11-15 22:11:48,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:48,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806527892] [2019-11-15 22:11:48,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:48,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:48,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 23 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:48,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806527892] [2019-11-15 22:11:48,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352546034] [2019-11-15 22:11:48,875 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:49,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 95 conjunts are in the unsatisfiable core [2019-11-15 22:11:49,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:49,314 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 14 treesize of output 10 [2019-11-15 22:11:49,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:49,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:49,320 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 22:11:49,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 22:11:49,502 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 22:11:49,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:49,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:49,503 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 22:11:49,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 22:11:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 23 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:49,515 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:49,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 43 [2019-11-15 22:11:49,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371371434] [2019-11-15 22:11:49,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 22:11:49,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 22:11:49,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1694, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:11:49,516 INFO L87 Difference]: Start difference. First operand 1510 states and 1715 transitions. Second operand 43 states. [2019-11-15 22:11:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:52,469 INFO L93 Difference]: Finished difference Result 2233 states and 2503 transitions. [2019-11-15 22:11:52,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 22:11:52,469 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 89 [2019-11-15 22:11:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:52,476 INFO L225 Difference]: With dead ends: 2233 [2019-11-15 22:11:52,476 INFO L226 Difference]: Without dead ends: 1895 [2019-11-15 22:11:52,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=280, Invalid=3260, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 22:11:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2019-11-15 22:11:52,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1768. [2019-11-15 22:11:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1768 states. [2019-11-15 22:11:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2011 transitions. [2019-11-15 22:11:52,490 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2011 transitions. Word has length 89 [2019-11-15 22:11:52,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:52,490 INFO L462 AbstractCegarLoop]: Abstraction has 1768 states and 2011 transitions. [2019-11-15 22:11:52,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 22:11:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2011 transitions. [2019-11-15 22:11:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 22:11:52,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:52,492 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:52,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:52,693 INFO L410 AbstractCegarLoop]: === Iteration 47 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:11:52,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash 28166690, now seen corresponding path program 9 times [2019-11-15 22:11:52,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:52,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342870273] [2019-11-15 22:11:52,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:52,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:52,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 12 proven. 165 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:11:53,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342870273] [2019-11-15 22:11:53,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105239804] [2019-11-15 22:11:53,364 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:53,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-15 22:11:53,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:11:53,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 124 conjunts are in the unsatisfiable core [2019-11-15 22:11:53,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:53,666 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 10 treesize of output 8 [2019-11-15 22:11:53,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:53,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:53,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:53,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 22:11:53,973 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 14 treesize of output 10 [2019-11-15 22:11:53,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:53,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:53,980 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 22:11:53,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-15 22:11:54,050 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 25 treesize of output 24 [2019-11-15 22:11:54,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:54,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:54,059 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 22:11:54,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2019-11-15 22:11:55,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:55,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 38 [2019-11-15 22:11:55,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:55,533 INFO L567 ElimStorePlain]: treesize reduction 12, result has 66.7 percent of original size [2019-11-15 22:11:55,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:55,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:8 [2019-11-15 22:11:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 12 proven. 165 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:11:55,682 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:55,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2019-11-15 22:11:55,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184485832] [2019-11-15 22:11:55,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-11-15 22:11:55,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:55,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-11-15 22:11:55,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=3395, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 22:11:55,683 INFO L87 Difference]: Start difference. First operand 1768 states and 2011 transitions. Second operand 60 states. [2019-11-15 22:12:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:02,525 INFO L93 Difference]: Finished difference Result 3175 states and 3606 transitions. [2019-11-15 22:12:02,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-15 22:12:02,525 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 90 [2019-11-15 22:12:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:02,530 INFO L225 Difference]: With dead ends: 3175 [2019-11-15 22:12:02,530 INFO L226 Difference]: Without dead ends: 3123 [2019-11-15 22:12:02,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2158 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=586, Invalid=10334, Unknown=0, NotChecked=0, Total=10920 [2019-11-15 22:12:02,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2019-11-15 22:12:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 2880. [2019-11-15 22:12:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2019-11-15 22:12:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3281 transitions. [2019-11-15 22:12:02,563 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3281 transitions. Word has length 90 [2019-11-15 22:12:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:02,563 INFO L462 AbstractCegarLoop]: Abstraction has 2880 states and 3281 transitions. [2019-11-15 22:12:02,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-11-15 22:12:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3281 transitions. [2019-11-15 22:12:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 22:12:02,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:02,567 INFO L380 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:02,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:02,771 INFO L410 AbstractCegarLoop]: === Iteration 48 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:12:02,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:02,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1201686230, now seen corresponding path program 14 times [2019-11-15 22:12:02,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:02,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586722887] [2019-11-15 22:12:02,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:02,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:02,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 93 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:03,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586722887] [2019-11-15 22:12:03,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838876784] [2019-11-15 22:12:03,346 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:03,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:12:03,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:03,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 90 conjunts are in the unsatisfiable core [2019-11-15 22:12:03,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 91 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:03,934 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:03,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 40 [2019-11-15 22:12:03,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862317232] [2019-11-15 22:12:03,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 22:12:03,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:03,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 22:12:03,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1453, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:12:03,935 INFO L87 Difference]: Start difference. First operand 2880 states and 3281 transitions. Second operand 41 states. [2019-11-15 22:12:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:05,839 INFO L93 Difference]: Finished difference Result 3353 states and 3768 transitions. [2019-11-15 22:12:05,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:12:05,840 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 93 [2019-11-15 22:12:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:05,844 INFO L225 Difference]: With dead ends: 3353 [2019-11-15 22:12:05,844 INFO L226 Difference]: Without dead ends: 3353 [2019-11-15 22:12:05,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=359, Invalid=2721, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 22:12:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2019-11-15 22:12:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 2960. [2019-11-15 22:12:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2960 states. [2019-11-15 22:12:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 3376 transitions. [2019-11-15 22:12:05,879 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 3376 transitions. Word has length 93 [2019-11-15 22:12:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:05,879 INFO L462 AbstractCegarLoop]: Abstraction has 2960 states and 3376 transitions. [2019-11-15 22:12:05,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 22:12:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3376 transitions. [2019-11-15 22:12:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 22:12:05,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:05,883 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:06,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:06,086 INFO L410 AbstractCegarLoop]: === Iteration 49 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:12:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash -140069249, now seen corresponding path program 10 times [2019-11-15 22:12:06,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:06,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179674666] [2019-11-15 22:12:06,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:06,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:06,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 47 proven. 151 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:12:06,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179674666] [2019-11-15 22:12:06,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502146700] [2019-11-15 22:12:06,456 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:06,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:12:06,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:06,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 117 conjunts are in the unsatisfiable core [2019-11-15 22:12:06,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:06,673 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 1=[|v_#valid_38|]} [2019-11-15 22:12:06,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:12:06,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-15 22:12:06,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:06,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:06,703 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 10 treesize of output 8 [2019-11-15 22:12:06,704 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:06,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:06,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:12:06,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-15 22:12:06,979 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 16 treesize of output 12 [2019-11-15 22:12:06,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:06,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:06,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:12:06,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-15 22:12:07,056 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 29 treesize of output 28 [2019-11-15 22:12:07,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:07,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:07,065 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 22:12:07,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-15 22:12:08,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:08,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2019-11-15 22:12:08,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:08,155 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.5 percent of original size [2019-11-15 22:12:08,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:12:08,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:30 [2019-11-15 22:12:08,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:12:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 50 proven. 148 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:12:08,437 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:08,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 31] total 51 [2019-11-15 22:12:08,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925317390] [2019-11-15 22:12:08,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-15 22:12:08,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:08,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-15 22:12:08,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2475, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 22:12:08,439 INFO L87 Difference]: Start difference. First operand 2960 states and 3376 transitions. Second operand 52 states. [2019-11-15 22:12:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:16,571 INFO L93 Difference]: Finished difference Result 3431 states and 3902 transitions. [2019-11-15 22:12:16,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-15 22:12:16,571 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 94 [2019-11-15 22:12:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:16,576 INFO L225 Difference]: With dead ends: 3431 [2019-11-15 22:12:16,576 INFO L226 Difference]: Without dead ends: 3431 [2019-11-15 22:12:16,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2707 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=729, Invalid=9573, Unknown=0, NotChecked=0, Total=10302 [2019-11-15 22:12:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2019-11-15 22:12:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3171. [2019-11-15 22:12:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3171 states. [2019-11-15 22:12:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 3618 transitions. [2019-11-15 22:12:16,612 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 3618 transitions. Word has length 94 [2019-11-15 22:12:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:16,613 INFO L462 AbstractCegarLoop]: Abstraction has 3171 states and 3618 transitions. [2019-11-15 22:12:16,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-15 22:12:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 3618 transitions. [2019-11-15 22:12:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:12:16,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:16,617 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:16,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:16,820 INFO L410 AbstractCegarLoop]: === Iteration 50 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:12:16,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:16,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1580663721, now seen corresponding path program 15 times [2019-11-15 22:12:16,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:16,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750221834] [2019-11-15 22:12:16,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:16,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:16,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 26 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:17,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750221834] [2019-11-15 22:12:17,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276345668] [2019-11-15 22:12:17,413 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:17,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-15 22:12:17,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:17,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 138 conjunts are in the unsatisfiable core [2019-11-15 22:12:17,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:17,782 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 10 treesize of output 8 [2019-11-15 22:12:17,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:17,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:17,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:12:17,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 22:12:18,352 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 22:12:18,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:18,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:18,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:12:18,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 22:12:18,410 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 22 treesize of output 21 [2019-11-15 22:12:18,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:18,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:18,419 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 22:12:18,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2019-11-15 22:12:19,557 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:19,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2019-11-15 22:12:19,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:19,571 INFO L567 ElimStorePlain]: treesize reduction 8, result has 68.0 percent of original size [2019-11-15 22:12:19,572 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 22:12:19,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:7 [2019-11-15 22:12:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 18 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:19,710 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:19,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 62 [2019-11-15 22:12:19,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112402271] [2019-11-15 22:12:19,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-11-15 22:12:19,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:19,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-11-15 22:12:19,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3611, Unknown=0, NotChecked=0, Total=3782 [2019-11-15 22:12:19,711 INFO L87 Difference]: Start difference. First operand 3171 states and 3618 transitions. Second operand 62 states. [2019-11-15 22:12:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:26,921 INFO L93 Difference]: Finished difference Result 4501 states and 5067 transitions. [2019-11-15 22:12:26,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-11-15 22:12:26,921 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 98 [2019-11-15 22:12:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:26,928 INFO L225 Difference]: With dead ends: 4501 [2019-11-15 22:12:26,928 INFO L226 Difference]: Without dead ends: 4051 [2019-11-15 22:12:26,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3445 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=660, Invalid=11772, Unknown=0, NotChecked=0, Total=12432 [2019-11-15 22:12:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2019-11-15 22:12:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 3733. [2019-11-15 22:12:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2019-11-15 22:12:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 4267 transitions. [2019-11-15 22:12:26,968 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 4267 transitions. Word has length 98 [2019-11-15 22:12:26,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:26,969 INFO L462 AbstractCegarLoop]: Abstraction has 3733 states and 4267 transitions. [2019-11-15 22:12:26,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-11-15 22:12:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 4267 transitions. [2019-11-15 22:12:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:12:26,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:26,972 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:27,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:27,177 INFO L410 AbstractCegarLoop]: === Iteration 51 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:12:27,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:27,177 INFO L82 PathProgramCache]: Analyzing trace with hash -960653028, now seen corresponding path program 5 times [2019-11-15 22:12:27,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:27,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173516603] [2019-11-15 22:12:27,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:27,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:27,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 12 proven. 191 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:12:27,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173516603] [2019-11-15 22:12:27,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217211343] [2019-11-15 22:12:27,721 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:27,958 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-15 22:12:27,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:27,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 89 conjunts are in the unsatisfiable core [2019-11-15 22:12:27,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:27,967 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 10 treesize of output 8 [2019-11-15 22:12:27,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:27,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:27,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:12:27,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 22:12:28,143 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 14 treesize of output 10 [2019-11-15 22:12:28,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:28,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:28,151 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 22:12:28,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-11-15 22:12:28,192 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 25 treesize of output 24 [2019-11-15 22:12:28,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:12:28,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:28,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 22:12:28,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2019-11-15 22:12:28,773 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:28,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2019-11-15 22:12:28,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:12:28,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:12:28,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:12:28,789 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 22:12:28,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:27 [2019-11-15 22:12:28,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:12:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 29 proven. 174 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:12:29,104 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:29,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 45 [2019-11-15 22:12:29,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669688994] [2019-11-15 22:12:29,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 22:12:29,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:29,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 22:12:29,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1860, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 22:12:29,105 INFO L87 Difference]: Start difference. First operand 3733 states and 4267 transitions. Second operand 45 states. [2019-11-15 22:12:34,421 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-11-15 22:12:41,083 WARN L191 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-11-15 22:12:45,695 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-15 22:12:53,138 WARN L191 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-15 22:12:56,987 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-15 22:13:01,625 WARN L191 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-15 22:13:15,353 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 22:13:27,345 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-15 22:13:31,707 WARN L191 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-15 22:13:38,401 WARN L191 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-15 22:13:45,640 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 22:14:04,238 WARN L191 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-15 22:14:10,065 WARN L191 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-15 22:14:18,482 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 22:14:20,412 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-15 22:14:29,400 WARN L191 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-11-15 22:14:32,822 WARN L191 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-15 22:14:36,869 WARN L191 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 22:14:39,496 WARN L191 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 22:14:44,333 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-11-15 22:14:45,630 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-15 22:14:49,769 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-11-15 22:14:50,016 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-15 22:14:52,886 WARN L191 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 22:14:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:58,830 INFO L93 Difference]: Finished difference Result 3940 states and 4455 transitions. [2019-11-15 22:14:58,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-15 22:14:58,830 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 99 [2019-11-15 22:14:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:58,832 INFO L225 Difference]: With dead ends: 3940 [2019-11-15 22:14:58,832 INFO L226 Difference]: Without dead ends: 2736 [2019-11-15 22:14:58,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 102.5s TimeCoverageRelationStatistics Valid=572, Invalid=7608, Unknown=10, NotChecked=0, Total=8190 [2019-11-15 22:14:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-11-15 22:14:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2461. [2019-11-15 22:14:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2019-11-15 22:14:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 2808 transitions. [2019-11-15 22:14:58,849 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 2808 transitions. Word has length 99 [2019-11-15 22:14:58,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:58,849 INFO L462 AbstractCegarLoop]: Abstraction has 2461 states and 2808 transitions. [2019-11-15 22:14:58,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 22:14:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 2808 transitions. [2019-11-15 22:14:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 22:14:58,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:58,851 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:59,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:59,052 INFO L410 AbstractCegarLoop]: === Iteration 52 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:14:59,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:59,052 INFO L82 PathProgramCache]: Analyzing trace with hash 552761030, now seen corresponding path program 16 times [2019-11-15 22:14:59,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:59,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011065163] [2019-11-15 22:14:59,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:59,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:59,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 122 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:59,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011065163] [2019-11-15 22:14:59,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592991981] [2019-11-15 22:14:59,498 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:59,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:14:59,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:14:59,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-15 22:14:59,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:59,727 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:59,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-15 22:14:59,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:59,740 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-15 22:14:59,741 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 22:14:59,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-15 22:14:59,771 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 15 treesize of output 11 [2019-11-15 22:14:59,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:59,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:59,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:14:59,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 22:15:00,267 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:00,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-15 22:15:00,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:15:00,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:00,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:15:00,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-15 22:15:00,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:15:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 149 proven. 49 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-15 22:15:00,408 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:00,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20] total 45 [2019-11-15 22:15:00,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976477982] [2019-11-15 22:15:00,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-15 22:15:00,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:00,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-15 22:15:00,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 22:15:00,409 INFO L87 Difference]: Start difference. First operand 2461 states and 2808 transitions. Second operand 46 states. [2019-11-15 22:15:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:04,914 INFO L93 Difference]: Finished difference Result 3357 states and 3712 transitions. [2019-11-15 22:15:04,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-11-15 22:15:04,915 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 102 [2019-11-15 22:15:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:04,917 INFO L225 Difference]: With dead ends: 3357 [2019-11-15 22:15:04,917 INFO L226 Difference]: Without dead ends: 2655 [2019-11-15 22:15:04,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2894 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1534, Invalid=10238, Unknown=0, NotChecked=0, Total=11772 [2019-11-15 22:15:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2019-11-15 22:15:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 1611. [2019-11-15 22:15:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-11-15 22:15:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 1832 transitions. [2019-11-15 22:15:04,932 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 1832 transitions. Word has length 102 [2019-11-15 22:15:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:04,932 INFO L462 AbstractCegarLoop]: Abstraction has 1611 states and 1832 transitions. [2019-11-15 22:15:04,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-15 22:15:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1832 transitions. [2019-11-15 22:15:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 22:15:04,933 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:04,933 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:05,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:05,134 INFO L410 AbstractCegarLoop]: === Iteration 53 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:15:05,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:05,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1974228854, now seen corresponding path program 11 times [2019-11-15 22:15:05,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:05,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100595073] [2019-11-15 22:15:05,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:05,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:05,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 14 proven. 234 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:15:05,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100595073] [2019-11-15 22:15:05,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659135001] [2019-11-15 22:15:05,984 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:06,224 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-15 22:15:06,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:06,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 136 conjunts are in the unsatisfiable core [2019-11-15 22:15:06,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:06,234 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 10 treesize of output 8 [2019-11-15 22:15:06,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:15:06,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:06,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:15:06,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 22:15:06,582 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 14 treesize of output 10 [2019-11-15 22:15:06,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:15:06,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:06,590 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 22:15:06,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-15 22:15:06,645 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 25 treesize of output 24 [2019-11-15 22:15:06,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:15:06,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:06,656 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 22:15:06,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:34 [2019-11-15 22:15:08,263 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:08,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 69 [2019-11-15 22:15:08,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:15:08,298 INFO L567 ElimStorePlain]: treesize reduction 28, result has 58.2 percent of original size [2019-11-15 22:15:08,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:15:08,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:52, output treesize:8 [2019-11-15 22:15:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 14 proven. 234 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:15:08,472 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:08,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2019-11-15 22:15:08,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127611713] [2019-11-15 22:15:08,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-11-15 22:15:08,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-11-15 22:15:08,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=3872, Unknown=0, NotChecked=0, Total=4032 [2019-11-15 22:15:08,473 INFO L87 Difference]: Start difference. First operand 1611 states and 1832 transitions. Second operand 64 states. [2019-11-15 22:15:13,816 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-11-15 22:15:17,945 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-11-15 22:15:22,110 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:15:26,239 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:15:30,371 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:15:34,508 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-11-15 22:15:38,662 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-15 22:15:42,830 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-11-15 22:15:47,003 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-11-15 22:15:51,143 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-11-15 22:15:55,274 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-15 22:15:59,418 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-11-15 22:16:03,695 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:16:07,274 WARN L191 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:16:11,411 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:16:15,619 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-11-15 22:16:19,726 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:16:24,044 WARN L191 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-11-15 22:16:28,164 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:16:32,390 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-11-15 22:16:36,668 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:16:40,956 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:16:45,171 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:16:49,514 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:16:53,376 WARN L191 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:16:57,850 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:17:02,137 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:17:06,595 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:17:10,770 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-11-15 22:17:14,935 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-15 22:17:19,080 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-15 22:17:23,239 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 22:17:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:24,051 INFO L93 Difference]: Finished difference Result 3373 states and 3815 transitions. [2019-11-15 22:17:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-15 22:17:24,051 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 102 [2019-11-15 22:17:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:17:24,053 INFO L225 Difference]: With dead ends: 3373 [2019-11-15 22:17:24,053 INFO L226 Difference]: Without dead ends: 3313 [2019-11-15 22:17:24,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2546 ImplicationChecksByTransitivity, 134.2s TimeCoverageRelationStatistics Valid=636, Invalid=12020, Unknown=0, NotChecked=0, Total=12656 [2019-11-15 22:17:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2019-11-15 22:17:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 2973. [2019-11-15 22:17:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2973 states. [2019-11-15 22:17:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2973 states and 3377 transitions. [2019-11-15 22:17:24,078 INFO L78 Accepts]: Start accepts. Automaton has 2973 states and 3377 transitions. Word has length 102 [2019-11-15 22:17:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:17:24,078 INFO L462 AbstractCegarLoop]: Abstraction has 2973 states and 3377 transitions. [2019-11-15 22:17:24,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-11-15 22:17:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 3377 transitions. [2019-11-15 22:17:24,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 22:17:24,081 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:17:24,081 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:17:24,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:17:24,282 INFO L410 AbstractCegarLoop]: === Iteration 54 === [mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION]=== [2019-11-15 22:17:24,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:24,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1142689433, now seen corresponding path program 12 times [2019-11-15 22:17:24,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:24,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009774744] [2019-11-15 22:17:24,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:24,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:24,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 68 proven. 205 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:17:24,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009774744] [2019-11-15 22:17:24,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207161735] [2019-11-15 22:17:24,827 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:17:25,255 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-15 22:17:25,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:17:25,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 64 conjunts are in the unsatisfiable core [2019-11-15 22:17:25,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:17:25,263 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 1=[|v_#valid_42|]} [2019-11-15 22:17:25,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:17:25,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-15 22:17:25,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:17:25,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:17:25,281 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 10 treesize of output 8 [2019-11-15 22:17:25,281 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:17:25,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:17:25,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:17:25,288 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-11-15 22:17:25,326 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 15 treesize of output 11 [2019-11-15 22:17:25,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:17:25,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:17:25,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:17:25,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 22:17:25,365 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 28 treesize of output 27 [2019-11-15 22:17:25,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:17:25,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:17:25,372 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 22:17:25,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-11-15 22:17:25,596 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:17:25,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-15 22:17:25,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:17:25,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:17:25,609 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 22:17:25,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:23 [2019-11-15 22:17:25,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:17:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-15 22:17:26,018 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:17:26,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12] total 34 [2019-11-15 22:17:26,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161346630] [2019-11-15 22:17:26,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 22:17:26,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:26,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 22:17:26,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:17:26,019 INFO L87 Difference]: Start difference. First operand 2973 states and 3377 transitions. Second operand 35 states. [2019-11-15 22:17:29,221 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-15 22:17:34,942 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-11-15 22:17:35,946 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-11-15 22:17:46,220 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-15 22:17:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:48,554 INFO L93 Difference]: Finished difference Result 3424 states and 3878 transitions. [2019-11-15 22:17:48,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-15 22:17:48,554 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2019-11-15 22:17:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:17:48,554 INFO L225 Difference]: With dead ends: 3424 [2019-11-15 22:17:48,554 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:17:48,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=969, Invalid=6338, Unknown=3, NotChecked=0, Total=7310 [2019-11-15 22:17:48,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:17:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:17:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:17:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:17:48,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-11-15 22:17:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:17:48,556 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:17:48,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 22:17:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:17:48,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:17:48,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:17:48,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:17:48 BoogieIcfgContainer [2019-11-15 22:17:48,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:17:48,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:17:48,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:17:48,766 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:17:48,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:06:46" (3/4) ... [2019-11-15 22:17:48,772 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:17:48,781 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 22:17:48,781 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-15 22:17:48,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-15 22:17:48,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-15 22:17:48,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-15 22:17:48,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 22:17:48,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2019-11-15 22:17:48,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-15 22:17:48,796 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-15 22:17:48,797 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-15 22:17:48,797 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 22:17:48,867 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3848409f-bfe9-48d6-a53a-0a03d342e46c/bin/uautomizer/witness.graphml [2019-11-15 22:17:48,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:17:48,868 INFO L168 Benchmark]: Toolchain (without parser) took 663476.65 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.1 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -83.9 MB). Peak memory consumption was 306.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:17:48,870 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 22:17:48,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 670.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -219.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:17:48,878 INFO L168 Benchmark]: Boogie Preprocessor took 65.20 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 22:17:48,879 INFO L168 Benchmark]: RCFGBuilder took 765.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:17:48,879 INFO L168 Benchmark]: TraceAbstraction took 661866.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.0 MB). Peak memory consumption was 283.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:17:48,880 INFO L168 Benchmark]: Witness Printer took 102.11 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:17:48,881 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 670.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -219.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.20 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 765.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 661866.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.0 MB). Peak memory consumption was 283.6 MB. Max. memory is 11.5 GB. * Witness Printer took 102.11 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 525]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 13 error locations. Result: SAFE, OverallTime: 661.7s, OverallIterations: 54, TraceHistogramMax: 10, AutomataDifference: 595.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2695 SDtfs, 10283 SDslu, 19130 SDs, 0 SdLazy, 88368 SolverSat, 1615 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 101.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4514 GetRequests, 2004 SyntacticMatches, 42 SemanticMatches, 2468 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40562 ImplicationChecksByTransitivity, 527.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3733occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 54 MinimizatonAttempts, 6379 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 48.6s InterpolantComputationTime, 5265 NumberOfCodeBlocks, 5224 NumberOfCodeBlocksAsserted, 179 NumberOfCheckSat, 5174 ConstructedInterpolants, 582 QuantifiedInterpolants, 4992320 SizeOfPredicates, 800 NumberOfNonLiveVariables, 10688 ConjunctsInSsa, 2489 ConjunctsInUnsatCore, 91 InterpolantComputations, 18 PerfectInterpolantSequences, 2414/8802 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...